A Hopf Bifurcation Theorem for Difference Equations Approximating a Differential Equation.
In this paper, Runge-Kutta methods are discussed for numerical solutions of conservative systems. For the energy of conservative systems being as close to the initial energy as possible, a modified version of explicit Runge-Kutta methods is presented. The order of the modified Runge-Kutta method is the same as the standard Runge-Kutta method, but it is superior in energy-preserving to the standard one. Comparing the modified Runge-Kutta method with the standard Runge-Kutta method, numerical experiments...
A key element of microscopic traffic flow simulation is the so-called car-following model, describing the way in which a typical driver interacts with other vehicles on the road. This model is typically continuous and traffic micro-simulator updates its vehicle positions by a numerical integration scheme. While increasing the order of the scheme should lead to more accurate results, most micro-simulators employ the simplest Euler rule. In our contribution, inspired by [1], we will provide some additional...
In this paper, we are concerned with numerical methods for linear neutral systems with multiple delays. For delay-dependently stable neutral systems, we ask what conditions must be imposed on linear multi-step methods in order that the numerical solutions display stability property analogous to that displayed by the exact solutions. Combining with Lagrange interpolation, linear multi-step methods can be applied to the neutral systems. Utilizing the argument principle, a sufficient condition is derived...
In this paper, we are concerned with stability of numerical methods for linear neutral systems with multiple delays. Delay-dependent stability of Runge-Kutta methods is investigated, i. e., for delay-dependently stable systems, we ask what conditions must be imposed on the Runge-Kutta methods in order that the numerical solutions display stability property analogous to that displayed by the exact solutions. By means of Lagrange interpolation, Runge-Kutta methods can be applied to neutral differential...
In der vorliegenden Arbeit wird der -Stabilitätsbegriff von Dahlquist, der die Grundlage für Stabilitätsuntersuchungen bei linearen Mehrschrittverfahren zur Lösung nichtlinearet Anfangswertaufgaben bildet, auf die Klasse der linearen Mehrschrittblockverfahren übertragen. Es wird nachgewiesen, das Blockverfahren, die in diesem Sinne stabil sind, höchstens die Konsistenzordnung 2 haben können.
In der vorliegenden Arbeit wird für lineare Mehrschrittblock verfahren zur numerischen Lösung von Anfangswertaufgaben eine explizite Konstruktionsmöglichkeit angegeben. Sie ermöglicht es, zu einem gegebenen Stabilitätspolynom ohne Lösung eines linearen Gleichungssystems die Koefizienten des zugehörigen Blockverfahrens zu berechnen.
The paper deals with some new methods for the numerical solution of initial value problems for ordinary differential equations. The main idea of these methods consists in the fact that in one step of the method a group of unknown values of the approximate solution is computed simultaneously. The class of methods under investigation is wide enough to contain almost all known classical methods. Sufficient conditions for convergence are found.
This paper is the continuation of the paper "Generalized periodic overimplicit multistep methods" of the same author and it deals with the necessary and, in some special cases, with the necessary and sufficient conditions for the convergence of general periodic overimplicit multistep methods.
We study the spectral stability of solitary wave solutions to the nonlinear Dirac equation in one dimension. We focus on the Dirac equation with cubic nonlinearity, known as the Soler model in (1+1) dimensions and also as the massive Gross-Neveu model. Presented numerical computations of the spectrum of linearization at a solitary wave show that the solitary waves are spectrally stable. We corroborate our results by finding explicit expressions for...