NGP_G-STABILITY OF LINEAR MULTISTEP METHODS FOR SYSTEMS OF GENERALIZED NEUTRAL DELAY DIFFERENTIAL EQUATIONS

The stability analysis of linear multistep methods for the numerical solutions of the systems of generalized neutral delay differential equations is discussed. The stability behaviour of linear multistep methods was analysed for the solution of the generalized system of linear neutral test equations, After the establishment of a sufficient condition for asymptotic stability of the solutions of the generalized system, it is shown that a linear multistep method is NGP(G)-stable if and only if it is A-stable.

Stability of linear multistep methods for delay differential equations in the light of Kreiss resolvent condition

This paper deals with the stability analysis of the linear multistep (LM) methods in the numerical solution of delay differential equations. Here we provide a qualitative stability estimates, pertiment to the classical scalar test problem of the form y′(t)=λy(t)+μy(t-τ) with τ>0 and λ,μ are complex, by using (vartiant to) the resolvent condition of Kreiss. We prove that for A stable LM methods the upper bound for the norm of the n th power of square matrix grows linearly with the order of the matrix.

Geometric representation for numerical stability region of linear multistep methods

Studies the numerical stability region of linear multistep(LM) methods applied to linear test equation of the form y′(t)=ay(t)+by(t-1), t>0, y(t)=g(t)-1≤t≤0, a,b∈R, proves through delay dependent stability analysis that the intersection of stability regions of the equation and the method is not empty, in addition to approaches to the boundary of the delay differential equation(DDEs) in the limiting case of step size boundary of the stability region of linear multistep methods.

Stability analysis of linear multistep methods for neutral delay differential equations

The stability analysis of linear multistep (LM) methods is carried out under Kreiss resolvent condition when they are applied to neutral delay differential equations of the form y′(t)=ay(t)+by(t-τ)+ cy′(t- τ) y(t)=g(t) -τ≤t≤0 with τ>0 and a, b and c∈, and it is proved that the ‖B n‖ is suitably bounded, where B is the companion matrix.

High Order Semi-implicit Multistep Methods for Time-Dependent Partial Differential Equations

We consider the construction of semi-implicit linear multistep methods that can be applied to time-dependent PDEs where the separation of scales in additive form,typically used in implicit-explicit(IMEX)methods,is not possible.As shown in Boscarino et al.(J.Sci.Comput.68:975-1001,2016)for Runge-Kutta methods,these semi-implicit techniques give a great flexibility,and allow,in many cases,the construction of simple linearly implicit schemes with no need of iterative solvers.In this work,we develop a general setting for the construction of high order semi-implicit linear multistep methods and analyze their stability properties for a prototype lineal'advection-diffusion equation and in the setting of strong stability preserving(SSP)methods.Our findings are demonstrated on several examples,including nonlinear reaction-diffusion and convection-diffusion problems.

Delay-dependent stability of linear multistep methods for differential systems with distributed delays

This paper deals with the stability of linear multistep methods for multidimensional differential systems with distributed delays. The delay-dependent stability of linear multistep methods with compound quadrature rules is studied. Several new sufficient criteria of delay-dependent stability are obtained by means of the argument principle. An algorithm is provided to check delay-dependent stability. An example that illustrates the effectiveness of the derived theoretical results is given.

STABILITY AND CONVERGENCE OF STEPSIZE-DEPENDENT LINEAR MULTISTEP METHODS FOR NONLINEAR DISSIPATIVE EVOLUTION EQUATIONS IN BANACH SPACE

Stability and global error bounds are studied for a class of stepsize-dependent linear multistep methods for nonlinear evolution equations governed by ω-dissipative vector fields in Banach space.To break through the order barrier p≤1 of unconditionally contractive linear multistep methods for dissipative systems,strongly dissipative systems are introduced.By employing the error growth function of the methods,new contractivity and convergence results of stepsize-dependent linear multistep methods on infinite integration intervals are provided for strictly dissipative systems(ω<0)and strongly dissipative systems.Some applications of the main results to several linear multistep methods,including the trapezoidal rule,are supplied.The theoretical results are also illustrated by a set of numerical experiments.

DELAY-DEPENDENT TREATMENT OF LINEAR MULTISTEP METHODS FOR NEUTRAL DELAY DIFFERENTIAL EQUATIONS

This paper deals with a delay-dependent treatment of linear multistep methods for neutral delay differential equations y'(t) = ay(t) + by(t - τ) + cy'(t - τ), t > 0, y(t) = g(t), -τ≤ t ≤ 0, a,b andc ∈ R. The necessary condition for linear multistep methods to be Nτ(0)-stable is given. It is shown that the trapezoidal rule is Nτ(0)-compatible. Figures of stability region for some linear multistep methods are depicted.

D-CONVERGENCE AND STABILITY OF A CLASS OF LINEAR MULTISTEP METHODS FOR NONLINEAR DDES

Presents information on a study which dealt with the error behavior and the stability analysis of a class of linear multistep methods with the Lagrangian interpolation as applied to the nonlinear delay differential equations. Methods and the basic lemmas; Analysis of convergence and stability.

VARIABLE STEP-SIZE IMPLICIT-EXPLICIT LINEAR MULTISTEP METHODS FOR TIME-DEPENDENT PARTIAL DIFFERENTIAL EQUATIONS

Implicit-explicit （IMEX） linear multistep methods are popular techniques for solving partial differential equations （PDEs） with terms of different types. While fixed timestep versions of such schemes have been developed and studied, implicit-explicit schemes also naturally arise in general situations where the temporal smoothness of the solution changes. In this paper we consider easily implementable variable step-size implicit-explicit （VSIMEX） linear multistep methods for time-dependent PDEs. Families of order-p, pstep VSIMEX schemes are constructed and analyzed, where p ranges from 1 to 4. The corresponding schemes are simple to implement and have the property that they reduce to the classical IMEX schemes whenever constant time step-sizes are imposed. The methods are validated on the Burgers＇ equation. These results demonstrate that by varying the time step-size, VSIMEX methods can outperform their fixed time step counterparts while still maintaining good numerical behavior.

SYMPLECTIC MULTISTEP METHODS FOR LINEAR HAMILTONIAN SYSTEMS

Three classes of symplectic multistep methods for linear Hamiltonian systems are constructed and their stabilities are discussed in this paper.

IMPLICIT-EXPLICIT MULTISTEP FINITE ELEMENT-MIXED FINITE ELEMENT METHODS FOR THE TRANSIENT BEHAVIOR OF A SEMICONDUCTOR DEVICE

The transient behavior of a semiconductor device consists of a Poisson equation for the electric potential and of two nonlinear parabolic equations for the electron density and hole density. The electric potential equation is discretized by a mixed finite element method. The electron and hole density equations are treated by implicit-explicit multistep finite element methods. The schemes are very efficient. The optimal order error estimates both in time and space are derived.

DELAY-DEPENDENT STABILITY OF LINEAR MULTISTEP METHODS FOR NEUTRAL SYSTEMS WITH DISTRIBUTED DELAYS

This paper considers the asymptotic stability of linear multistep(LM)methods for neutral systems with distributed delays.In particular,several sufficient conditions for delay-dependent stability of numerical solutions are obtained based on the argument principle.Compound quadrature formulae are used to compute the integrals.An algorithm is proposed to examine the delay-dependent stability of numerical solutions.Several numerical examples are performed to verify the theoretical results.

THE STABILITY OF LINEAR MULTISTEP METHODS FOR LINEAR SYSTEMS OF NEUTRAL DIFFERENTIAL EQUATIONS

Presents information on a study which focused on the numerical solution of initial value problems for systems of neutral differential equations. Adaptations of linear multistep methods; Linear stability of linear multistep method; Presentation of numerical equations.

CONJUGATE-SYMPLECTICITY OF LINEAR MULTISTEP METHODS

For the numerical treatment of Hamiltonian differential equations, symplectic integrators are the most suitable choice, and methods that are conjugate to a symplectic integrator share the same good long-time behavior. This note characterizes linear multistep methods whose underlying one-step method is conjugate to a symplectic integrator. The bounded- hess of parasitic solution components is not addressed.

Algebraic Stability of Multistep Runge-Kutta Methods

A series of sufficient and necessary conditions for the algebraic stability of multistepRunge-Kutta methods is obtained, most of which can be regarded as extension of the relevant results available for Runge-Kutta methods, especially, for Radau Ⅰ A, Radau Ⅱ A and Gaussian Runge-Kutta methods.

Dissipativity of Multistep Runge-Kutta Methods for Nonlinear Neutral Delay-Integro-Differential Equations with Constrained Grid

This paper is concerned with the numerical dissipativity of multistep Runge-Kutta methods for nonlinear neutral delay-integro-differential equations.We investigate the dissipativity properties of-algebraically stable multistep Runge-Kutta methods with constrained grid.The finite-dimensional and infinite-dimensional dissipativity results of-algebraically stable multistep Runge-Kutta methods are obtained.

GRID-INDEPENDENT CONSTRUCTION OF MULTISTEP METHODS

A new polynomial formulation of variable step size linear multistep methods is pre- sented, where each k-step method is characterized by a fixed set of k - 1 or k parameters. This construction includes all methods of maximal order （p = k for stiff, and p = k ＋ 1 for nonstiff problems）. Supporting time step adaptivity by construction, the new formulation is not based on extending classical fixed step size methods; instead classical methods are obtained as fixed step size restrictions within a unified framework. The methods are imple- mented in MATLAB, with local error estimation and a wide range of step size controllers. This provides a platform for investigating and comparing different multistep method in realistic operational conditions. Computational experiments show that the new multi- step method construction and implementation compares favorably to existing software, although variable order has not yet been included.

A Proof of the Non-Singularity of the <i>D</i>Matrix Used in Deriving the Two—Step Butcher’s Hybrid Scheme for the Solution of Initial Value Problems

In this paper, we state and prove the conditions for the non-singularity of the D matrix used in deriving the continuous form of the Two-step Butcher’s hybrid scheme and from it the discrete forms are deduced. We also show that the discrete scheme gives outstanding results for the solution of stiff and non-stiff initial value problems than the 5th order Butcher’s algorithm in predictor-corrector form.

CONVERGENCE OF LINEAR MULTISTEP METHODS FOR TWO-PARAMETER SINGULAR PERTURBATION PROBLEMS

Some convergence results are given for A(a)-stable linear multistep methods applied to two classes of two-parameter singular perturbation problems, which extend the existing relevant results about one-parameter problems by Lubich~[1]. Some numerical examples confirm our results.