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 te...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.展开更多
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. ...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.展开更多
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 ...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.展开更多
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 ...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.展开更多
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 establi...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.展开更多
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)...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.展开更多
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 conditio...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.展开更多
A class of parallel Runge-Kutta Methods for differential-algebraic equations of index 2are constructed for multiprocessor system. This paper gives the order conditions and investigatesthe convergence theory for such m...A class of parallel Runge-Kutta Methods for differential-algebraic equations of index 2are constructed for multiprocessor system. This paper gives the order conditions and investigatesthe convergence theory for such methods.展开更多
This paper deals with the parallel diagonal implicit Runge-Kutta methods for solving DDEs with a constant delay. It is shown that the suitable choice of the predictor matrix can guarantee the stability of the methods....This paper deals with the parallel diagonal implicit Runge-Kutta methods for solving DDEs with a constant delay. It is shown that the suitable choice of the predictor matrix can guarantee the stability of the methods. It is proved that for the suitable selection of the diagonal matrix D, the method based on Radau IIA is δ-convergent, and the estimates for the non-stiff speed and the stiff speed of convergence are given.展开更多
基金This research was supported by the National Natural Science Foundation of China （Nos. 41230210 and 41204074）, the Science Foundation of the Education Department of Yunnan Province （No. 2013Z152）, and Statoil Company （Contract No. 4502502663）.
文摘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.
文摘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.
基金Project supported by the National Natural Science Foundation of China (No. 11071067)the Hunan Graduate Student Science and Technology Innovation Project (No. CX2011B184)
文摘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.
基金supported by the National Natural Science Foundation of China (Nos. 10772147 and10632030)the Ph. D. Program Foundation of Ministry of Education of China (No. 20070699028)+2 种基金the Natural Science Foundation of Shaanxi Province of China (No. 2006A07)the Open Foundationof State Key Laboratory of Structural Analysis of Industrial Equipment (No. GZ0802)the Foundation for Fundamental Research of Northwestern Polytechnical University
文摘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.
基金Project supported by the National Natural Science Foundation of China(No.11432010)the Doctoral Program Foundation of Education Ministry of China(No.20126102110023)+2 种基金the 111Project of China(No.B07050)the Fundamental Research Funds for the Central Universities(No.310201401JCQ01001)the Innovation Foundation for Doctor Dissertation of Northwestern Polytechnical University(No.CX201517)
文摘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.
文摘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.
文摘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.
文摘A class of parallel Runge-Kutta Methods for differential-algebraic equations of index 2are constructed for multiprocessor system. This paper gives the order conditions and investigatesthe convergence theory for such methods.
文摘This paper deals with the parallel diagonal implicit Runge-Kutta methods for solving DDEs with a constant delay. It is shown that the suitable choice of the predictor matrix can guarantee the stability of the methods. It is proved that for the suitable selection of the diagonal matrix D, the method based on Radau IIA is δ-convergent, and the estimates for the non-stiff speed and the stiff speed of convergence are given.
