Convergence analysis of the one-step iterative Krylov subspace methods

DOI10.3103/S1068362309050045zbMath1193.47019OpenAlexW1984631837MaRDI QIDQ1049378

Levon Gevorgyan

Publication date: 12 January 2010

Published in: Journal of Contemporary Mathematical Analysis. Armenian Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1068362309050045

zbMATH Keywords

spectral theoryconvergence rateKrylov subspace methodgeneralized minimal residual methodconvex compact subsetoptimal circleRichardson's iterations

Mathematics Subject Classification ID

Norms (inequalities, more than one norm, etc.) of linear operators (47A30) Numerical range, numerical radius (47A12) Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50) Jacobi (tridiagonal) operators (matrices) and generalizations (47B36)

Cites Work

• Unnamed Item
• Unnamed Item
• Numerical range, GMRES and Faber polynomials.
• Fields of values and iterative methods
• Recent computational developments in Krylov subspace methods for linear systems
• Geometric aspects of the theory of Krylov subspace methods
• The Four-or-More Vertex Theorem
• From Potential Theory to Matrix Iterations in Six Steps

This page was built for publication: Convergence analysis of the one-step iterative Krylov subspace methods