Round off error analysis for Gram-Schmidt method and solution of linear least squares problems
From MaRDI portal
Publication:5646301
Cites work
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 3248502 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Experiments on Error Growth Associated with Some Linear Least-Squares Procedures
- Experiments on Gram-Schmidt Orthogonalization
- Numerical methods for solving linear least squares problems
- Practical use of the symmetric Lanczos process with re-orthogonalization
- Solving linear least squares problems by Gram-Schmidt orthogonalization
Cited in
(24)- Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods
- On the estimation of numerical error bounds in linear algebra based on discrete stochastic arithmetic
- Computational methods of linear algebra
- Gram-Schmidt orthogonalization: 100 years and more
- Reorthogonalized block classical Gram-Schmidt using two Cholesky-based TSQR algorithms
- Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
- Impact of accuracy optimization on the convergence of numerical iterative methods
- Backward error analysis of the shift-and-invert Arnoldi algorithm
- Report on test matrices for generalized inverses
- Reorthogonalized block classical Gram-Schmidt
- Block Modified Gram--Schmidt Algorithms and Their Analysis
- A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting
- Randomized Gram-Schmidt process with application to GMRES
- Numerical stability of orthogonalization methods with a non-standard inner product
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Numerics of Gram-Schmidt orthogonalization
- The loss of orthogonality in the Gram-Schmidt orthogonalization process
- The stability of block variants of classical Gram-Schmidt
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Randomized flexible GMRES with deflated restarting
- Computing a compact local Smith–McMillan form
- Block Gram-Schmidt algorithms and their stability properties
- Test procedures and test problems for least squares algorithms
- On the solution of the linear least squares problems and pseudo-inverses
This page was built for publication: Round off error analysis for Gram-Schmidt method and solution of linear least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5646301)
