scientific article; zbMATH DE number 712354
From MaRDI portal
Publication:4320128
computational resultslarge sparse linear least squares problemssparsity-preserving orthogonal transformations
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Recommendations
Cited in
(14)- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- scientific article; zbMATH DE number 6850057 (Why is no real title available?)
- Matrix enlarging methods and their application
- Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
- scientific article; zbMATH DE number 4109938 (Why is no real title available?)
- Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
- QR factorization for the regularized least squares problem on hypercubes
- Ordering Givens Rotations for Sparse $QR$ Factorization
- MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
- scientific article; zbMATH DE number 51442 (Why is no real title available?)
- A Sparse QS-Decomposition for Large Sparse Linear System of Equations
- A fast preconditioner for the incompressible Navier-Stokes equations
- Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems
- Low‐rank revealing QR factorizations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4320128)
