Roundoff-error-free QR factorization via integer-preserving Gram Schmidt orthogonalization
From MaRDI portal
Cites work
- A Geometric Theory for the QR, LU and Power Iterations
- A massively-parallel electronic-structure calculations based on real-space density functional theory
- Accuracy and Stability of Numerical Algorithms
- Elimination with weighted row combinations for solving linear equations and least squares problems
- Exact QR factorizations of rectangular matrices
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations
- Fast multiplication of large numbers
- Gram-Schmidt Orthogonalization by Gauss Elimination
- Gram-Schmidt orthogonalization: 100 years and more
- How Tight is Hadamard's Bound?
- scientific article; zbMATH DE number 1254303 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- Improved Gram-Schmidt type downdating methods
- Iterative algorithms for Gram-Schmidt orthogonalization
- Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
- Note on the iterative refinement of least squares solution
- Numerical methods for large eigenvalue problems
- Numerically stable methods for quadratic programming
- On some algorithms for the solution of the complete eigenvalue problem
- On the training and generalization of deep operator networks
- QR factorization with complete pivoting and accurate computation of the SVD
- Rang revealing QR factorizations
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- Résolution d'une question relative aux déterminants.
- Shifted Cholesky QR for computing the QR factorization of ill-conditioned matrices
- Some Applications of the Rank Revealing QR Factorization
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- Systems of distinct representatives and linear algebra
- The loss of orthogonality in the Gram-Schmidt orthogonalization process
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The Use ofQRFactorization in Sparse Quadratic Programming and Backward Error Issues
This page was built for publication: Roundoff-error-free QR factorization via integer-preserving Gram Schmidt orthogonalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907580)
