On the stable implementation of the generalized minimal error method
From MaRDI portal
Several implementations of the generalized minimal error (GMERR) method are examined for solving nonsymmetric systems of linear equations that minimize the Euclidean norm of the error in the related generalized Krylov subspace. A new variant of the GMERR method is introduced and its stable implementation based on Householder transformations is discussed. Numerical stability is analyzed and numerical examples illustrate the methodology.
Recommendations
Cites work
- A simpler GMRES
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Changing the Norm in Conjugate Gradient Type Algorithms
- Error-Minimizing Krylov Subspace Methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 417773 (Why is no real title available?)
- scientific article; zbMATH DE number 3881771 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3787937 (Why is no real title available?)
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 934729 (Why is no real title available?)
- Implementation of the GMRES Method Using Householder Transformations
- Implementations of the GMRES method
- Iterative algorithms for Gram-Schmidt orthogonalization
- Numerical behaviour of the modified Gram-Schmidt GMRES implementation
- Numerical stability of GMRES
- On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices
- Preconditioning strategies for models of incompressible flow
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Residual smoothing and peak/plateau behavior in Krylov subspace methods
- Residual Smoothing Techniques for Iterative Methods
- Solution of Sparse Indefinite Systems of Linear Equations
- The N‐Step Iteration Procedures
- The method of minimum iterations with minimum errors for a system of linear algebraic equations with a symmetrical matrix
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
Cited in
(6)- Special issue: Developments and trends in iterative methods for large systems of equations -- in memoriam Rüdiger Weiss. Minisymposium: 16th IMACS world congress, Lausanne, Switzerland, August 21--25, 2000
- A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß
- Numerical stability of GMRES
- On error indicators for optimizing parameters in stabilized methods
- The regularized global GMERR method for solving large-scale linear discrete ill-posed problems
- The regularized block GMERR method and its simpler version for solving large-scale linear discrete ill-posed problems
This page was built for publication: On the stable implementation of the generalized minimal error method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1298807)