Efficient implementations of the modified Gram-Schmidt orthogonalization with a non-standard inner product
From MaRDI portal
Publication:2318512
DOI10.1007/s13160-019-00356-4zbMath1436.65046arXiv1703.10440OpenAlexW2615651518WikidataQ127973503 ScholiaQ127973503MaRDI QIDQ2318512
Akira Imakura, Yusaku Yamamoto
Publication date: 15 August 2019
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.10440
error boundsmodified Gram-Schmidt orthogonalizationnon-standard inner productefficient implementations
Related Items
Cholesky QR-based retraction on the generalized Stiefel manifold, Householder Orthogonalization with a Nonstandard Inner Product, Saving memory space in deep neural networks by recomputing: a survey, Shifted Cholesky QR for Computing the QR Factorization of Ill-Conditioned Matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Numerical stability of orthogonalization methods with a non-standard inner product
- A note on the error analysis of classical Gram-Schmidt
- Weighted FOM and GMRES for solving nonsymmetric linear systems
- On the modified Gram-Schmidt algorithm for weighted and constrained linear least squares problems
- Block Krylov-type complex moment-based eigensolvers for solving generalized eigenvalue problems
- Matrix Algorithms
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- Householder triangularization of a quasimatrix
- A Weighted Block GMRES method for solving linear systems with multiple right-hand sides
- Roundoff error analysis of the CholeskyQR2 algorithm in an oblique inner product
- Accuracy and Stability of Numerical Algorithms
- Retooling the method of block conjugate gradients