Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
From MaRDI portal
Publication:4880252
DOI10.1137/S0895479893246765zbMath0855.65021MaRDI QIDQ4880252
Anne Greenbaum, Jane K. Cullum
Publication date: 3 February 1997
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
iterative methodsKrylov subspace methodsGalerkin methodsArnoldi methodGMRES methodsbiorthogonalizationbiconjugate gradientsnorm minimization method
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)
Related Items
Minimal polynomial and reduced rank extrapolation methods are related, On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems, Hybrid methods based on LCG and GMRES, Flexible BiCG and flexible Bi-CGSTAB for nonsymmetric linear systems, Lanczos-type variants of the COCR method for complex nonsymmetric linear systems, A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß, A note on the convergence behavior of GMRES, Conjugate gradient and minimal residual method for solving symmetric indefinite systems, A preconditioned Krylov subspace iterative methods for inverse source problem by virtue of a regularizing LM-DRBEM, Noise representation in residuals of LSQR, LSMR, and CRAIG regularization, Unnamed Item, IDR: a new generation of Krylov subspace methods?, Abstract perturbed Krylov methods, 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, FOM accelerated by an extrapolation method for solving PageRank problems, GMRES implementations and residual smoothing techniques for solving ill-posed linear systems, Admissible and Attainable Convergence Behavior of Block Arnoldi and GMRES, Analysis of peaks and plateaus in a Galerkin/minimal residual pair of methods for solving \(Ax=b\), GMRES algorithms over 35 years, Iterative methods for solving \(Ax=b\), GMRES/FOM versus QMR/BiCG, Convergence analysis of Krylov subspace methods, 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, Iterative solution of linear systems in the 20th century, Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems, Analysis of the convergence of the minimal and the orthogonal residual methods, Error Bounds for Lanczos-Based Matrix Function Approximation
