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.

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.

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.

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.

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.

Numerical Stability and Oscillations of Runge-Kutta Methods for Differential Equations with Piecewise Constant Arguments of Advanced Type

For differential equations with piecewise constant arguments of advanced type, numerical stability and oscillations of Runge-Kutta methods are investigated. The necessary and sufficient conditions under which the numerical stability region contains the analytic stability region are given. The conditions of oscillations for the Runge-Kutta methods are obtained also. We prove that the Runge-Kutta methods preserve the oscillations of the analytic solution. Moreover, the relationship between stability and oscillations is discussed. Several numerical examples which confirm the results of our analysis are presented.

Three-stage Stiffly Accurate Runge-Kutta Methods for Stiff Stochastic Differential Equations

In this paper we discuss diagonally implicit and semi-implicit methods based on the three-stage stiffly accurate Runge-Kutta methods for solving Stratonovich stochastic differential equations（SDEs）.Two methods,a three-stage stiffly accurate semi-implicit（SASI3） method and a three-stage stiffly accurate diagonally implicit （SADI3） method,are constructed in this paper.In particular,the truncated random variable is used in the implicit method.The stability properties and numerical results show the effectiveness of these methods in the pathwise approximation of stiff SDEs.

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.

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.

Two Implicit Runge-Kutta Methods for Stochastic Differential Equation

In this paper, the Ito-Taylor expansion of stochastic differential equation is briefly introduced. The colored rooted tree theory is applied to derive strong order 1.0 implicit stochastic Runge-Kutta method(SRK). Two fully implicit schemes are presented and their stability qualities are discussed. And the numerical report illustrates the better numerical behavior.

Enforcing Strong Stability of Explicit Runge-Kutta Methods with Superviscosity

A time discretization method is called strongly stable(or monotone),if the norm of its numerical solution is nonincreasing.Although this property is desirable in various of contexts,many explicit Runge-Kutta(RK)methods may fail to preserve it.In this paper,we enforce strong stability by modifying the method with superviscosity,which is a numerical technique commonly used in spectral methods.Our main focus is on strong stability under the inner-product norm for linear problems with possibly non-normal operators.We propose two approaches for stabilization:the modified method and the filtering method.The modified method is achieved by modifying the semi-negative operator with a high order superviscosity term;the filtering method is to post-process the solution by solving a diffusive or dispersive problem with small superviscosity.For linear problems,most explicit RK methods can be stabilized with either approach without accuracy degeneration.Furthermore,we prove a sharp bound(up to an equal sign)on diffusive superviscosity for ensuring strong stability.For nonlinear problems,a filtering method is investigated.Numerical examples with linear non-normal ordinary differential equation systems and for discontinuous Galerkin approximations of conservation laws are performed to validate our analysis and to test the performance.

Numerical Dispersion Relation of Multi-symplectic Runge-Kutta Methods for Hamiltonian PDEs

Numerical dispersion relation of the multi-symplectic Runge-Kutta （MSRK） method for linear Hamiltonian PDEs is derived in the present paper, which is shown to be a discrete counterpart to that possessed by the differential equation. This provides further understanding of MSRK methods. However, much still remains to be investigated further.

Optimized Runge-Kutta Methods with Automatic Step Size Control for Compressible Computational Fluid Dynamics

We develop error-control based time integration algorithms for compressible fluid dynam-ics(CFD)applications and show that they are efficient and robust in both the accuracy-limited and stability-limited regime.Focusing on discontinuous spectral element semidis-cretizations,we design new controllers for existing methods and for some new embedded Runge-Kutta pairs.We demonstrate the importance of choosing adequate controller parameters and provide a means to obtain these in practice.We compare a wide range of error-control-based methods,along with the common approach in which step size con-trol is based on the Courant-Friedrichs-Lewy(CFL)number.The optimized methods give improved performance and naturally adopt a step size close to the maximum stable CFL number at loose tolerances,while additionally providing control of the temporal error at tighter tolerances.The numerical examples include challenging industrial CFD applications.

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.

Numerical Stability of the Runge-Kutta Methods for Equations u′(t) = au(t)+bu([K/N*t]) in Science Computation

Differential equation has widely applied in science and engineering calculation. Runge Kutta method is a main method for solving differential equations. In this paper, the numerical properties of Runge-Kutta methods for the equation u′(t) = au(t)+bu([K/N* t]) is dealed with, where K and N is relatively prime and K < N,K,N∈ Z+. The conditions are obtained under which the numerical solutions preserve the analytical stability properties of the analytic ones and some numerical experiments are given.

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.

梁振动方程的多辛Runge-Kutta Nystrom算法

针对梁振动方程问题,给出了一个多辛Hamilton形式,利用Runge-Kutta Nystrm算法离散此多辛结构,得到离散多辛守恒律,并求得了一个等价于Runge-Kutta Nystrm积分的新格式,证明了它的稳定性条件。利用数值计算方法验证了理论分析的正确性。

Multi-symplectic methods for membrane free vibration equation

In this paper, the multi-symplectic formulations of the membrane free vibration equation with periodic boundary conditions in Hamilton space are considered. The complex method is introduced and a semi-implicit twenty-seven-points scheme with certain discrete conservation laws-a multi-symplectic conservation law （CLS）, a local energy conservation law （ECL） as well as a local momentum conservation law （MCL） --is constructed to discrete the PDEs that are derived from the membrane free vibration equation. The results of the numerical experiments show that the multi-symplectic scheme has excellent long-time numerical behavior,