On difference schemes for quasilinear evolution problems.
In long-time numerical integration of Hamiltonian systems, and especially in molecular dynamics simulation, it is important that the energy is well conserved. For symplectic integrators applied with sufficiently small step size, this is guaranteed by the existence of a modified Hamiltonian that is exactly conserved up to exponentially small terms. This article is concerned with the simplified Takahashi-Imada method, which is a modification of the Störmer-Verlet method that is as easy to implement...
Discontinuous Galerkin (DG) methods are starting to be a very popular solver for stiff ODEs. To be able to prove some more subtle properties of DG methods it can be shown that the DG method is equivalent to a specific collocation method which is in turn equivalent to an even more specific implicit Runge-Kutta (RK) method. These equivalences provide us with another interesting view on the DG method and enable us to employ well known techniques developed already for any of these methods. Our aim will...
We deal with the numerical simulation of a motion of viscous compressible fluids. We discretize the governing Navier–Stokes equations by the backward difference formula – discontinuous Galerkin finite element (BDF-DGFE) method, which exhibits a sufficiently stable, efficient and accurate numerical scheme. The BDF-DGFE method requires a solution of one linear algebra system at each time step. In this paper, we deal with these linear algebra systems with the aid of an iterative solver. We discuss...
As a numerical method for solving ordinary differential equations , the improved Euler method is not assumed to give exact solutions. In this paper we classify all cases where this method gives the exact solution for all initial conditions. We reduce an infinite system of partial differential equations for to a finite system that is sufficient and necessary for the improved Euler method to give the exact solution. The improved Euler method is the simplest explicit second order Runge-Kutta method....
In the present paper we are concerned with the problem of numerical solution of ordinary differential equations with parameters. Our method is based on a one-step procedure for IDEs combined with an iterative process. Simple sufficient conditions for the convergence of this method are obtained. Estimations of errors and some numerical examples are given.
A general theory of one-step methods for two-point boundary value problems with parameters is developed. On nonuniform nets , one-step schemes are considered. Sufficient conditions for convergence and error estimates are given. Linear or quadratic convergence is obtained by Theorem 1 or 2, respectively.
We illustrate the use of the recent approach by P. Albrecht to the derivation of order conditions for partitioned Runge-Kutta methods for ordinary differential equations.