Splitting methods for second-order initial value problems
convergencefactorization iterationimplicit methodinner iterationiterative solution methodsmethod of linesmodified Newton methodouter iterationstabilitystiff systems
Nonlinear ordinary differential equations and systems (34A34) Nonlinear parabolic equations (35K55) Numerical methods for initial value problems involving ordinary differential equations (65L05) Stability and convergence of numerical methods for ordinary differential equations (65L20) Method of lines for initial value and initial-boundary value problems involving PDEs (65M20)
The authors consider stiff initial value problems for systems of second-order ordinary differential equations of the special form \((*)\) \({d^2y(t)\over dt^2}= f(y(t))\), where \(y, f\in\mathbb{R}^d\). In this context stiff means that the stepsize \(h\) is such that in the neighborhood of the exact solution \(h^2\cdot\rho \left({\partial f\over\partial y}\right)\gg 1\), where \(\rho\) is the spectral radius of the Jacobian matrix. Equations of this type often arise if time-dependent partial differential equations are semidiscretized by the method of lines. Solving such equations by an implicit method implies that one is faced with the problem of solving systems of implicit relations. The paper under review focuses on the construction and analysis of iterative solution methods which are effective in cases where an approximation \(J\) to the Jacobian \({\partial f\over\partial y}\) can be split into a sum of matrices \(J_i\) with an essentially simpler structure than the matrix \(J\). These iterative methods consist of the modified Newton method (outer iteration), in which the linear Newton systems are solved by a second iteration process (the inner iteration) which is based on approximate factorization. The inner-outer iteration process is called by the authors approximate factorization iteration. The authors show to what extent the convergence and stability results valid for first-order ordinary differential equation methods change in the second-order case \((*)\). A number of convergence results is derived for the model situation where the matrices \(J_i\) share the same eigensystem and possess a negative eigenvalue spectrum. Finally, the authors present order of accuracy and stability results in the case of a finite number of inner and outer iterations.
- Analysis approximate factorization in iteration methods
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 50395 (Why is no real title available?)
- scientific article; zbMATH DE number 3999169 (Why is no real title available?)
- Implementation of Implicit Formulas for the Solution of ODE<scp>s</scp>
- The iterative solution of fully implicit discretizations of three-dimensional transport models
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- Two-stage and Three-stage Diagonally Implicit Runge-Kutta Nyström Methods of Orders Three and Four
- Unconditionally stable methods for second order differential equations
- Efficient implementation of Gauss collocation and Hamiltonian boundary value methods
- Iterated Splitting Method of High Order for Time-Dependent Partial Differential Equations
- scientific article; zbMATH DE number 4074394 (Why is no real title available?)
- A first-second order splitting method for a third-order partial differential equation
This page was built for publication: Splitting methods for second-order initial value problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1281789)
