The use of approximate factorization in stiff ODE solvers
We consider implicit integration methods for the numerical solution of stiff initial-value problems. In applying such methods, the implicit relations are usually solved by Newton iteration. However, it often happens that in subintervals of the integration interval the problem is nonstiff or mildly stiff with respect to the stepsize. In these nonstiff subintervals we do not need the (expensive) Newton iteration process. This motivated us to look for an iteration process that converges in mildly stiff situations and is less costly than Newton iteration. The process we have in mind uses modified Newton iteration as the outer iteration process and a linear solver for solving the linear Newton systems an an inner iteration process. This linear solver is based on an approximate factorization of the Newton system matrix by splitting this matrix into its lower and upper triangular part. The purpose of this paper is to combine fixed point iteration, approximate factorization iteration and Newton iteration into one iteration process for use in initial-value problems where the degree of stiffness is changing during the integration.
|Initial value problems (msc 65L05), Stability and convergence of numerical methods (msc 65L20)|
|Modelling, Analysis and Simulation [MAS]|
van der Houwen, P.J, & Sommeijer, B.P. (1997). The use of approximate factorization in stiff ODE solvers. Modelling, Analysis and Simulation [MAS]. CWI.