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.

A Class of Explicit Parallel Multistep Runge-Kutta Methods

In this paper, a rather general class of explicit parallel multistep Runge-Kutta methods is constructed for solving initial value problem of ordinary differential equations. Also, the corresponding convergence and stability are analysed. Several parallel computational formulae are given. The numerical experiments, including accuracy, speedup, and efficiency tests show that the methods are efficient.

Stability Analysis and Performance Evaluation of Additive Mixed-Precision Runge-Kutta Methods

Additive Runge-Kutta methods designed for preserving highly accurate solutions in mixed-precision computation were previously proposed and analyzed.These specially designed methods use reduced precision for the implicit computations and full precision for the explicit computations.In this work,we analyze the stability properties of these methods and their sensitivity to the low-precision rounding errors,and demonstrate their performance in terms of accuracy and efficiency.We develop codes in FORTRAN and Julia to solve nonlinear systems of ODEs and PDEs using the mixed-precision additive Runge-Kutta(MP-ARK)methods.The convergence,accuracy,and runtime of these methods are explored.We show that for a given level of accuracy,suitably chosen MP-ARK methods may provide significant reductions in runtime.

Stability and Time-Step Constraints of Implicit-Explicit Runge-Kutta Methods for the Linearized Korteweg-de Vries Equation

This paper provides a study on the stability and time-step constraints of solving the linearized Korteweg-de Vries(KdV)equation,using implicit-explicit(IMEX)Runge-Kutta(RK)time integration methods combined with either finite difference(FD)or local discontinuous Galerkin(DG)spatial discretization.We analyze the stability of the fully discrete scheme,on a uniform mesh with periodic boundary conditions,using the Fourier method.For the linearized KdV equation,the IMEX schemes are stable under the standard Courant-Friedrichs-Lewy(CFL)conditionτ≤λh.Here,λis the CFL number,τis the time-step size,and h is the spatial mesh size.We study several IMEX schemes and characterize their CFL number as a function ofθ=d/h^(2)with d being the dispersion coefficient,which leads to several interesting observations.We also investigate the asymptotic behaviors of the CFL number for sufficiently refined meshes and derive the necessary conditions for the asymptotic stability of the IMEX-RK methods.Some numerical experiments are provided in the paper to illustrate the performance of IMEX methods under different time-step constraints.

Dissipativity of Multistep Runge-Kutta Methods for Nonlinear Volterra Delay-integro-differential Equations

This paper is concerned with the numerical dissipativity of multistep Runge-Kutta methods for nonlinear Volterra delay-integro-differential equations. We investigate the dissipativity properties of （k, l）- algebraically stable multistep Runge-Kutta methods with constrained grid and an uniform grid. The finite- dimensional and infinite-dimensional dissipativity results of （k, /）-algebraically stable Runge-Kutta methods are obtained.

ASYMPTOTIC BEHAVIOR OF MULTISTEP RUNGE-KUTTA METHODS FOR SYSTEMS OF DELAY DIFFERENTIAL EQUATIONS

This paper deals with the asymptotic behavior of multistep Runge-Kutta methods for systems of delay differential equations (DDEs). With the help of K.J.in't Hout's analytic technique for the numerical stability of onestep Runge-Kutta methods, we obtain that a multistep Runge-Kutta method for DDEs is stable iff the corresponding methods for ODEs is A-stable under suitable interpolation conditions.

Symplectic partitioned Runge-Kutta method based onthe eighth-order nearly analytic discrete operator and its wavefield simulations

We propose a symplectic partitioned Runge-Kutta （SPRK） method with eighth-order spatial accuracy based on the extended Hamiltonian system of the acoustic waveequation. Known as the eighth-order NSPRK method, this technique uses an eighth-orderaccurate nearly analytic discrete （NAD） operator to discretize high-order spatial differentialoperators and employs a second-order SPRK method to discretize temporal derivatives.The stability criteria and numerical dispersion relations of the eighth-order NSPRK methodare given by a semi-analytical method and are tested by numerical experiments. We alsoshow the differences of the numerical dispersions between the eighth-order NSPRK methodand conventional numerical methods such as the fourth-order NSPRK method, the eighth-order Lax-Wendroff correction （LWC） method and the eighth-order staggered-grid （SG）method. The result shows that the ability of the eighth-order NSPRK method to suppress thenumerical dispersion is obviously superior to that of the conventional numerical methods. Inthe same computational environment, to eliminate visible numerical dispersions, the eighth-order NSPRK is approximately 2.5 times faster than the fourth-order NSPRK and 3.4 timesfaster than the fourth-order SPRK, and the memory requirement is only approximately47.17% of the fourth-order NSPRK method and 49.41% of the fourth-order SPRK method,which indicates the highest computational efficiency. Modeling examples for the two-layermodels such as the heterogeneous and Marmousi models show that the wavefields generatedby the eighth-order NSPRK method are very clear with no visible numerical dispersion.These numerical experiments illustrate that the eighth-order NSPRK method can effectivelysuppress numerical dispersion when coarse grids are adopted. Therefore, this methodcan greatly decrease computer memory requirement and accelerate the forward modelingproductivity. In general, the eighth-order NSPRK method has tremendous potential value forseismic exploration and seismology research.

HIGH-ORDER RUNGE-KUTTA DISCONTINUOUS GALERKIN FINITE ELEMENT METHOD FOR 2-D RESONATOR PROBLEM

The Runge-Kutta discontinuous Galerkin finite element method （RK-DGFEM） is introduced to solve the classical resonator problem in the time domain. DGFEM uses unstructured grid discretization in the space domain and it is explicit in the time domain. Consequently it is a best mixture of FEM and finite volume method （FVM）. RK-DGFEM can obtain local high-order accuracy by using high-order polynomial basis. Numerical experiments of transverse magnetic （TM） wave propagation in a 2-D resonator are performed. A high-order Lagrange polynomial basis is adopted. Numerical results agree well with analytical solution. And different order Lagrange interpolation polynomial basis impacts on simulation result accuracy are discussed. Computational results indicate that the accuracy is evidently improved when the order of interpolation basis is increased. Finally, L^2 errors of different order polynomial basis in RK-DGFEM are presented. Computational results show that L^2 error declines exponentially as the order of basis increases.

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.

CONVERGENCE ANALYSIS OF RUNGE-KUTTA METHODS FOR A CLASS OF RETARDED DIFFERENTIAL ALGEBRAIC SYSTEMS

This article deals with a class of numerical methods for retarded differential algebraic systems with time-variable delay. The methods can be viewed as a combination of Runge-Kutta methods and Lagrange interpolation. A new convergence concept, called DA-convergence, is introduced. The DA-convergence result for the methods is derived. At the end, a numerical example is given to verify the computational effectiveness and the theoretical result.

Runge-Kutta method, finite element method, and regular algorithms for Hamiltonian system

The symplectic algorithm and the energy conservation algorithm are two important kinds of algorithms to solve Hamiltonian systems. The symplectic Runge- Kutta （RK） method is an important part of the former, and the continuous finite element method （CFEM） belongs to the later. We find and prove the equivalence of one kind of the implicit RK method and the CFEM, give the coefficient table of the CFEM to simplify its computation, propose a new standard to measure algorithms for Hamiltonian systems, and define another class of algorithms --the regular method. Finally, numerical experiments are given to verify the theoretical results.

Projected Runge-Kutta methods for constrained Hamiltonian systems

Projected Runge-Kutta （R-K） methods for constrained Hamiltonian systems are proposed. Dynamic equations of the systems, which are index-3 differential-algebraic equations （DAEs） in the Heisenberg form, are established under the framework of Lagrangian multipliers. R-K methods combined with the technique of projections are then used to solve the DAEs. The basic idea of projections is to eliminate the constraint violations at the position, velocity, and acceleration levels, and to preserve the total energy of constrained Hamiltonian systems by correcting variables of the position, velocity, acceleration, and energy. Numerical results confirm the validity and show the high precision of the proposed method in preserving three levels of constraints and total energy compared with results reported in the literature.

Multi-symplectic Runge-Kutta methods for Landau-Ginzburg-Higgs equation

Nonlinear wave equations have been extensively investigated in the last sev- eral decades. The Landau-Ginzburg-Higgs equation, a typical nonlinear wave equation, is studied in this paper based on the multi-symplectic theory in the Hamilton space. The multi-symplectic Runge-Kutta method is reviewed, and a semi-implicit scheme with certain discrete conservation laws is constructed to solve the first-order partial differential equations （PDEs） derived from the Landau-Ginzburg-Higgs equation. The numerical re- sults for the soliton solution of the Landau-Ginzburg-Higgs equation are reported, showing that the multi-symplectic Runge-Kutta method is an efficient algorithm with excellent long-time numerical behaviors.

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.

A class of twostep continuity Runge-Kutta methods for solving singular delay differential equations and its convergence

An idea of relaxing the effect of delay when computing the Runge-Kutta stages in the current step and a class of two-step continuity Runge-Kutta methods （TSCRK） is presented. Their construction, their order conditions and their convergence are studied. The two-step continuity Runge-Kutta methods possess good numerical stability properties and higher stage-order, and keep the explicit process of computing the Runge-Kutta stages. The numerical experiments show that the TSCRK methods are efficient.

Superconvergence Analysis of the Runge-Kutta Discontinuous Galerkin Method with Upwind-Biased Numerical Flux for Two-Dimensional Linear Hyperbolic Equation

In this paper,we shall establish the superconvergence properties of the Runge-Kutta dis-continuous Galerkin method for solving two-dimensional linear constant hyperbolic equa-tion,where the upwind-biased numerical flux is used.By suitably defining the correction function and deeply understanding the mechanisms when the spatial derivatives and the correction manipulations are carried out along the same or different directions,we obtain the superconvergence results on the node averages,the numerical fluxes,the cell averages,the solution and the spatial derivatives.The superconvergence properties in space are pre-served as the semi-discrete method,and time discretization solely produces an optimal order error in time.Some numerical experiments also are given.

Delay-dependent stability analysis of Runge-Kutta methods for neutral delay differential equations

The aim of this paper is to study the asymptotic stability properties of Runge Kutta(R-K) methods for neutral differential equations(NDDEs) when they are applied to the linear test equation of the form: y′(t)=ay(t)+by(t-τ)+cy’(t-τ), t>0, y(t)=g(t), -τ≤t≤0, with a,b,c∈[FK(W+3mm\.3mm][TPP129A,+3mm?3mm,BP], τ>0 and g(t) is a continuous real value function. In this paper we are concerned with the dependence of stability region on a fixed but arbitrary delay τ. In fact, it is one of the N.Guglielmi open problems to investigate the delay dependent stability analysis for NDDEs. The results that the 2,3 stages non natural R-K methods are unstable as Radau IA and Lobatto IIIC are proved. And the s stages Radau IIA methods are unstable, however all Gauss methods are compatible.

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.

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.