Upper bounds for convergence rates of acceleration methods with initial iterations

DOI10.1023/A:1019113314010zbMath0917.65029OpenAlexW1625685045MaRDI QIDQ1275439

Avram Sidi, Yair Shapira

Publication date: 5 August 1999

Published in: Numerical Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

numerical examplesconvergence accelerationGMRES methodgeneralized minimal residual methodlarge linear systemsRichardson iterations

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (6)

Minimal polynomial and reduced rank extrapolation methods are related ⋮ Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem ⋮ A convergence study for reduced rank extrapolation on nonlinear systems ⋮ FOM accelerated by an extrapolation method for solving PageRank problems ⋮ Preconditioning spectral element schemes for definite and indefinite problems ⋮ Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations

This page was built for publication: Upper bounds for convergence rates of acceleration methods with initial iterations