Preconditioning in implicit initial-value problem methods on parallel computers
DOI10.1007/BF02070820zbMath0824.65050MaRDI QIDQ1895883
Publication date: 13 November 1995
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
convergencepreconditioningparallel computationNewton iterationinitial-value problemLU-decompositionimplicit step-by-step methods
Nonlinear ordinary differential equations and systems (34A34) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Numerical methods for initial value problems involving ordinary differential equations (65L05) Method of lines for initial value and initial-boundary value problems involving PDEs (65M20)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel step-by-step methods
- The search for the Holy Grail, or: Predictor-corrector methods for solving ODEIVPs
- Efficient block predictor-corrector methods with a small number of corrections
- Stability of parallel Volterra-Runge-Kutta methods
- The error behaviour of a general class of predictor-corrector methods
- Parallel block predictor-corrector methods of Runge-Kutta type
- Parallel iteration of high-order Runge-Kutta methods with stepsize control
- The Evolution of Computational Methods in Aerodynamics
- Iterated Runge–Kutta Methods on Parallel Computers
- Stabilization of explicit methods for hyperbolic partial differential equations
- Analysis of Smoothing Matrices for the Preconditioning of Elliptic Difference Equations
- The Faber polynomials for circular sectors
- Non-linear stability of a general class of differential equation methods
- The Potential for Parallelism in Runge–Kutta Methods. Part 1: RK Formulas in Standard Form
This page was built for publication: Preconditioning in implicit initial-value problem methods on parallel computers