Further analysis of minimum residual iterations

DOI10.1002/(SICI)1099-1506(200003)7:2%3C67::AID-NLA186%3E3.0.CO;2-8zbMATH Open0983.65035MaRDI QIDQ2760331FDOQ2760331

Authors: Y. Saad 

Publication date: 19 December 2001

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Recommendations

• Residual and backward error bounds in minimum residual Krylov subspace methods
• Expressions and bounds for the GMRES residual
• On the residual norm in FOM and GMRES
• Computable Convergence Bounds for GMRES
• Superlinear convergence in minimum residual iterations

zbMATH Keywords

algorithmsconvergenceerror boundsnumerical examplescondition numberminimal residual methodsKrylov subspace techniqueshighly non-normal matrices

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Cites Work

• Title not available (Why is that?)

Cited In (12)

• Further analysis of the remedian algorithm
• Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
• Alternating oblique projections for coupled linear systems
• By how much can residual minimization accelerate the convergence of orthogonal residual methods?
• Title not available (Why is that?)
• Expansion par minimisation du résidu dynamique
• Residual and backward error bounds in minimum residual Krylov subspace methods
• Convergence conditions for a restarted GMRES method augmented with eigenspaces
• On the residual norm in FOM and GMRES
• GMRES algorithms over 35 years
• Analysis of two-grid methods: The nonnormal case
• A Fourier Transform Analysis of Convergence Properties of Multigrid V-Cycle Algorithm

Uses Software

• eigs

This page was built for publication: Further analysis of minimum residual iterations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760331)