Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
Arnoldi methodbackward stabilitycondition numbersgeneralized minimum residual (GMRES) methoditerative solutionKrylov subspace methodslarge sparse matricesleast squareslinear equationsloss of orthogonalitymodified Gram-Schmidt algorithmQR factorizationrounding error analysissingular values
Iterative numerical methods for linear systems (65F10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Orthogonalization in numerical linear algebra (65F25) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Roundoff error (65G50)
- 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
- Parallel algebraic hybrid solvers for large 3D convection-diffusion problems
- Numerical behaviour of the modified Gram-Schmidt GMRES implementation
- Reorthogonalized block classical Gram-Schmidt
- Block Gram-Schmidt algorithms and their stability properties
- Numerical simulation of influence of surface features on the elastohydrodynamic lubrication of sliding line contact using Krylov subspace method
- A stabilized GMRES method for singular and severely ill-conditioned systems of linear equations
- Evaluation of Abramowitz functions in the right half of the complex plane
- Wavelet preconditioned Newton-Krylov method for elastohydrodynamic lubrication of line contact problems
- An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process
- GMRES algorithms over 35 years
- On the robustness of numerical algorithms for linear systems and signal processing in finite precision arithmetic
- Imposing symmetry in augmented linear systems.
- Stability of the MGS-like elimination method for equality constrained least squares problems
- On the generation of Krylov subspace bases
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Algebraic and discretization error estimation by equilibrated fluxes for discontinuous Galerkin methods on nonmatching grids
- Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods
- A Krylov subspace type method for electrical impedance tomography
- Extrapolating the Arnoldi algorithm to improve eigenvector convergence
- A Note on Inexact Inner Products in GMRES
- Accuracy of the Lanczos process for the eigenproblem and solution of equations
- Block Modified Gram--Schmidt Algorithms and Their Analysis
- Weighted Inner Products for GMRES and GMRES-DR
- Three-precision GMRES-based iterative refinement for least squares problems
- A block minimum residual norm subspace solver with partial convergence management for sequences of linear systems
- Randomized Gram-Schmidt process with application to GMRES
- Mixed precision algorithms in numerical linear algebra
- Parallel solution of mixed finite element/spectral element systems for convection-diffusion equations on non-matching grids
- Five-Precision GMRES-Based Iterative Refinement
- Adaptive Precision Sparse Matrix–Vector Product and Its Application to Krylov Solvers
- Iterated Gauss-Seidel GMRES
- Towards understanding CG and GMRES through examples
- Analyzing vector orthogonalization algorithms
- Probabilistic rounding error analysis of modified Gram-Schmidt
- Reorthogonalized block classical Gram-Schmidt using two Cholesky-based TSQR algorithms
- Efficient GMRES+AMG on GPUs: composite smoothers and mixed V-cycles
- On some orthogonalization schemes in tensor train format
- Roundoff-error-free QR factorization via integer-preserving Gram Schmidt orthogonalization
- On the backward stability of s-step GMRES
- Theory of Krylov subspace methods based on the Arnoldi process with inexact inner products
- Augmented MGS-CGS block-Arnoldi recycling solvers
- Rounding error analysis of the inverse compact WY modified Gram-Schmidt algorithms
- A note on TT-GMRES for the solution of parametric linear systems
- An object-oriented C++ implementation of Davidson method for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
- Numerical study of mixed precision GMRES(m) preconditioned by deflation
- Randomized Tucker-Sketched GMRES
- Adaptive version of simpler GMRES
- Perturbation analysis of generalized saddle point systems
- Using multiple levels of parallelism to enhance the performance of domain decomposition solvers
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)