The use of approximate factorization in stiff ODE solvers

DOI10.1016/S0377-0427(98)00125-3zbMath0932.65078MaRDI QIDQ1298665

B. P. Sommeijer, P. J. van der Houwen

Publication date: 2 March 2000

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

convergencenumerical examplesstiff ordinary differential equationsoperator splittingapproximate factorizationNewton methodimplicit methodsstepsize restriction

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50)

Related Items (2)

Efficient implementation of Gauss collocation and Hamiltonian boundary value methods ⋮ Factorization in block-triangularly implicit methods for shallow water applications

Uses Software

• RODAS

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel-iterated Runge-Kutta methods for stiff ordinary differential equations
• Analysis approximate factorization in iteration methods
• The iterative solution of fully implicit discretizations of three-dimensional transport models
• A comparison of preconditioners in the solution of parabolic systems in three space dimensions using DASPK and a high order finite element method
• The solution of a combustion problem with Rosenbrock methods
• Implementation of Implicit Formulas for the Solution of ODE<scp>s</scp>
• Solving Ordinary Differential Equations II

This page was built for publication: The use of approximate factorization in stiff ODE solvers