Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems

DOI10.1137/S0895479893246765zbMATH Open0855.65021MaRDI QIDQ4880252FDOQ4880252

Publication date: 3 February 1997

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Recommendations

Numerical stability of GMRES
scientific article; zbMATH DE number 992795
Further analysis of minimum residual iterations
Expressions and bounds for the GMRES residual
A Theoretical Comparison of the Arnoldi and GMRES Algorithms
Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Residual and backward error bounds in minimum residual Krylov subspace methods
Numerical behaviour of the modified Gram-Schmidt GMRES implementation
Analysis of the convergence of the minimal and the orthogonal residual methods

zbMATH Keywords

Krylov subspace methods iterative methods Galerkin methods Arnoldi method GMRES methods biorthogonalization biconjugate gradients norm minimization method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)

Cited In (33)

Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
Iterative methods for unsymmetric linear systems
Analysis of peaks and plateaus in a Galerkin/minimal residual pair of methods for solving \(Ax=b\)
IDR: a new generation of Krylov subspace methods?
Error Bounds for Lanczos-Based Matrix Function Approximation
GMRES implementations and residual smoothing techniques for solving ill-posed linear systems
On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
Analysis of the convergence of the minimal and the orthogonal residual methods
Title not available (Why is that?)
A Theoretical Comparison of the Arnoldi and GMRES Algorithms
Iterative solution of linear systems in the 20th century
Iterative methods for solving \(Ax=b\), GMRES/FOM versus QMR/BiCG
Hybrid methods based on LCG and GMRES
A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß
Conjugate gradient and minimal residual method for solving symmetric indefinite systems
Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
Near-optimal convergence of the full orthogonalization method
Admissible and attainable convergence behavior of block Arnoldi and GMRES
Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems.
Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation
Abstract perturbed Krylov methods
A preconditioned Krylov subspace iterative methods for inverse source problem by virtue of a regularizing LM-DRBEM
A note on the convergence behavior of GMRES
Ritz and harmonic Ritz values and the convergence of FOM and GMRES
FOM accelerated by an extrapolation method for solving PageRank problems
Convergence analysis of Krylov subspace methods
Flexible BiCG and flexible Bi-CGSTAB for nonsymmetric linear systems
The effect of non-optimal bases on the convergence of Krylov subspace methods
On partial Cholesky factorization and a variant of quasi-Newton preconditioners for symmetric positive definite matrices
A note on convergence of quasi-minimal residual smoothing
GMRES algorithms over 35 years
Minimal polynomial and reduced rank extrapolation methods are related

This page was built for publication: Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems

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