The use of approximate factorization in sti ODE solvers
نویسنده
چکیده
We consider implicit integration methods for the numerical solution of sti 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 nonsti or mildly sti with respect to the stepsize. In these nonsti subintervals, we do not need the (expensive) Newton iteration process. This motivated us to look for an iteration process that converges in mildly sti situations and is less costly than Newton iteration. The process we have in mind uses modi ed Newton iteration as the outer iteration process and a linear solver for solving the linear Newton systems as 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 xed point iteration, approximate factorization iteration and Newton iteration into one iteration process for use in initial-value problems where the degree of sti ness is changing during the integration. c © 1998 Elsevier Science B.V. All rights reserved.
منابع مشابه
Numerical Time Integration for Air Pollution Models
Due to the large number of chemical species and the three space dimensions, o -the-shelf sti ODE integrators are not feasible for the numerical time integration of sti systems of advection-diffusion-reaction equations @c @t +r (uc) = r (Kr c) +R (c) ; c = c(x; t); c 2 IRm; x 2 IR3 from the eld of air pollution modelling. This has led to the use of special time integration techniques. This paper...
متن کاملTHE USE OF SEMI INHERITED LU FACTORIZATION OF MATRICES IN INTERPOLATION OF DATA
The polynomial interpolation in one dimensional space R is an important method to approximate the functions. The Lagrange and Newton methods are two well known types of interpolations. In this work, we describe the semi inherited interpolation for approximating the values of a function. In this case, the interpolation matrix has the semi inherited LU factorization.
متن کاملILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کاملCvode, a Stiff/nonstiff Ode Solver in C
CVODE is a package written in C for solving initial value problems for ordinary di erential equations. It provides the capabilities of two older Fortran packages, VODE and VODPK. CVODE solves both sti and nonsti systems, using variable-coe cient Adams and BDF methods. In the sti case, options for treating the Jacobian of the system include dense and band matrix solvers, and a preconditioned Kry...
متن کاملComplete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
متن کامل