When modified Gram-Schmidt generates a well-conditioned set of vectors
From MaRDI portal
Publication:4787672
DOI10.1093/IMANUM/22.4.521zbMATH Open1027.65050OpenAlexW1966343138MaRDI QIDQ4787672FDOQ4787672
Authors: L. Giraud, Julien Langou 
Publication date: 12 May 2003
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/188d081a07c1afefc6e04d0cb0204d1dd5ab19bc
Recommendations
- Efficient implementations of the modified Gram-Schmidt orthogonalization with a non-standard inner product
- A Robust Criterion for the Modified Gram--Schmidt Algorithm with Selective Reorthogonalization
- A note on the modified gram-schmidt process
- A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting
- An approach of orthogonalization within the Gram-Schmidt algorithm
- scientific article; zbMATH DE number 5039032
- Ordered modified Gram-Schmidt orthogonalization revised
- Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm
- scientific article; zbMATH DE number 124578
- On growth factors of the modified Gram-Schmidt algorithm
Numerical computation of matrix norms, conditioning, scaling (65F35) Orthogonalization in numerical linear algebra (65F25)
Cited In (12)
- Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector
- Error analysis of an incremental proper orthogonal decomposition algorithm for PDE simulation data
- Gram-Schmidt orthogonalization: 100 years and more
- Stability analysis of the two-level orthogonal Arnoldi procedure
- Ordered modified Gram-Schmidt orthogonalization revised
- Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
- An improved algorithm for the multidimensional moment-constrained maximum entropy problem
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- The multidimensional moment-constrained maximum entropy problem: A BFGS algorithm with constraint scaling
- Adaptive reduced basis strategy based on goal oriented error assessment for stochastic problems
- Block Gram-Schmidt algorithms and their stability properties
- Parallelization of the rational Arnoldi algorithm
This page was built for publication: When modified Gram-Schmidt generates a well-conditioned set of vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4787672)
