Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
From MaRDI portal
Publication:5470534
Krylov subspace methodsleast squaressingular valueslinear equationscondition numbersArnoldi methoditerative solutionbackward stabilityQR factorizationrounding error analysislarge sparse matricesloss of orthogonalitymodified Gram-Schmidt algorithmgeneralized minimum residual (GMRES) method
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Roundoff error (65G50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Orthogonalization in numerical linear algebra (65F25)
Recommendations
- Numerical behaviour of the modified Gram-Schmidt GMRES implementation
- Using FGMRES to obtain backward stability in mixed precision
- GMRES methods for least squares problems
- Stability of the MGS-like elimination method for equality constrained least squares problems
- Generalizations and modifications of the GMRES iterative method
- scientific article; zbMATH DE number 1533197
- Convergence in Backward Error of Relaxed GMRES
- A numerically stable block modified Gram-Schmidt algorithm solving stiff weighted least squares problems
- A stabilized GMRES method for singular and severely ill-conditioned systems of linear equations
- scientific article; zbMATH DE number 1500186
Cited in
(40)- A Krylov subspace type method for electrical impedance tomography
- Extrapolating the Arnoldi algorithm to improve eigenvector convergence
- Probabilistic rounding error analysis of modified Gram-Schmidt
- Mixed precision algorithms in numerical linear algebra
- A Note on Inexact Inner Products in GMRES
- Imposing symmetry in augmented linear systems.
- Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods
- Five-Precision GMRES-Based Iterative Refinement
- Perturbation analysis of generalized saddle point systems
- Numerical simulation of influence of surface features on the elastohydrodynamic lubrication of sliding line contact using Krylov subspace method
- Using multiple levels of parallelism to enhance the performance of domain decomposition solvers
- Reorthogonalized block classical Gram-Schmidt using two Cholesky-based TSQR algorithms
- On the generation of Krylov subspace bases
- Wavelet preconditioned Newton-Krylov method for elastohydrodynamic lubrication of line contact problems
- Stability of the MGS-like elimination method for equality constrained least squares problems
- Evaluation of Abramowitz functions in the right half of the complex plane
- Iterated Gauss-Seidel GMRES
- Reorthogonalized block classical Gram-Schmidt
- Accuracy of the Lanczos process for the eigenproblem and solution of equations
- An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process
- A block minimum residual norm subspace solver with partial convergence management for sequences of linear systems
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- Block Modified Gram--Schmidt Algorithms and Their Analysis
- Parallel solution of mixed finite element/spectral element systems for convection-diffusion equations on non-matching grids
- Adaptive Precision Sparse Matrix–Vector Product and Its Application to Krylov Solvers
- Efficient GMRES+AMG on GPUs: composite smoothers and mixed \(V\)-cycles
- A stabilized GMRES method for singular and severely ill-conditioned systems of linear equations
- Parallel algebraic hybrid solvers for large 3D convection-diffusion problems
- On the robustness of numerical algorithms for linear systems and signal processing in finite precision arithmetic
- Randomized Gram-Schmidt process with application to GMRES
- Weighted Inner Products for GMRES and GMRES-DR
- An object-oriented C++ implementation of Davidson method for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
- Algebraic and discretization error estimation by equilibrated fluxes for discontinuous Galerkin methods on nonmatching grids
- Towards understanding CG and GMRES through examples
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Adaptive version of simpler GMRES
- Three-precision GMRES-based iterative refinement for least squares problems
- GMRES algorithms over 35 years
- Analyzing vector orthogonalization algorithms
- Block Gram-Schmidt algorithms and their stability properties
This page was built for publication: Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470534)
