Polynomial preconditioning in Krylov-ROW-methods
DOI10.1016/S0168-9274(98)00058-0zbMath0924.65066OpenAlexW2042355428MaRDI QIDQ1294525
Bernhard A. Schmitt, Rüdiger Weiner
Publication date: 29 June 1999
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-9274(98)00058-0
polynomial preconditionersnumerical examplespreconditioninginitial value problemsstiff systemsRosenbrock-Wanner methodsKrylov subspace iterationROW-methods
Nonlinear ordinary differential equations and systems (34A34) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multiple scale methods for ordinary differential equations (34E13)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Runge-Kutta methods of order four with stepsize control for stiff ordinary differential equations
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- The Tchebychev iteration for nonsymmetric linear systems
- Equilibrium attractivity of Krylov-\(W\)-methods for nonlinear stiff ODEs
- Numerical experiments with Krylov integrators
- ROWMAP -- a ROW-code with Krylov techniques for large stiff ODEs
- Matrix-free \(W\)-methods using a multiple Arnoldi iteration
- Iterative Solution of Linear Equations in ODE Codes
- A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
- A Restarted GMRES Method Augmented with Eigenvectors