The convergence rate of block preconditioned systems arising from LMF-based ODE codes

DOI10.1023/A:1021906926616zbMath0987.65030OpenAlexW144457986MaRDI QIDQ5952340

Michael Kwok-Po Ng, Daniele Bertaccini

Publication date: 9 June 2002

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021906926616

zbMATH Keywords

preconditioningconjugate gradient methodcirculant Toeplitz matricesimplicit linear multistep formulaslinear boundary value problems

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Linear boundary value problems for ordinary differential equations (34B05)

Related Items (6)

Limited memory block preconditioners for fast solution of fractional partial differential equations ⋮ Generalized Kronecker product splitting iteration for the solution of implicit Runge-Kutta and boundary value methods ⋮ A splitting preconditioner for the iterative solution of implicit Runge-Kutta and boundary value methods ⋮ Kronecker product based preconditioners for boundary value method discretizations of space fractional diffusion equations ⋮ Reliable preconditioned iterative linear solvers for some numerical integrators ⋮ Preconditioned iterative method for boundary value method discretizations of a parabolic optimal control problem

This page was built for publication: The convergence rate of block preconditioned systems arising from LMF-based ODE codes