Analysis approximate factorization in iteration methods
convergencefactorizationiterative methodsNewton iterationparallel computationstability regionsstiff systems
Nonlinear ordinary differential equations and systems (34A34) Nonlinear parabolic equations (35K55) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) 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) Parallel numerical computation (65Y05)
The article is concerned with stiff systems of ordinary differential equations arising from spiritual discretization of time- and space-dependent partial differential equations. Since numerical solvers for corresponding initial value problems must necessarily be implicit for stability reasons, a large system of equations has to be solved in each time step. For the solution of the linear systems occurring in a corresponding Newton iteration, the authors propose a parallel iterative solver based on an approximate factorization of the matrix. In particular, convergence and stability regions are derived.
- A-stable parallel block methods for ordinary and integro-differential equations
- A note on stability of the Douglas splitting method
- Highly stable parallel Runge-Kutta methods
- scientific article; zbMATH DE number 40971 (Why is no real title available?)
- scientific article; zbMATH DE number 3999169 (Why is no real title available?)
- Iterated Runge–Kutta Methods on Parallel Computers
- Parallel Runge-Kutta methods with real eigenvalues
- The iterative solution of fully implicit discretizations of three-dimensional transport models
- Triangularly Implicit Iteration Methods for ODE-IVP Solvers
- Recent advances in linear analysis of convergence for splittings for solving ODE problems
- Splitting methods for second-order initial value problems
- The use of approximate factorization in stiff ODE solvers
- The iterative solution of fully implicit discretizations of three-dimensional transport models
- ADI schemes for higher-order nonlinear diffusion equations.
- Analysis of the variable length nonzero window method for exponentiation
- Application of approximate matrix factorization to high order linearly implicit Runge-Kutta methods
- Iterative and noniterative, full and approximate factorization methods for multidimensional reaction-diffusion equations
- List Factoring and Relative Worst Order Analysis
- scientific article; zbMATH DE number 3882077 (Why is no real title available?)
- Parallel solution of a coupled flow and transport model for shallow water
- An Analysis of Approximate Nonlinear Elimination
- Factorization in block-triangularly implicit methods for shallow water applications
- Approximate factorization for time-dependent partial differential equations
- Iterative modified approximate factorization
This page was built for publication: Analysis approximate factorization in iteration methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294522)