scientific article; zbMATH DE number 712354
zbMATH Open0813.65061MaRDI QIDQ4320128FDOQ4320128
Authors: P. Matstoms 
Publication date: 17 January 1995
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (14)
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- QR factorization for the regularized least squares problem on hypercubes
- Title not available (Why is that?)
- MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
- Ordering Givens Rotations for Sparse $QR$ Factorization
- Low‐rank revealing QR factorizations
- Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems
- A Sparse QS-Decomposition for Large Sparse Linear System of Equations
- Title not available (Why is that?)
- Matrix enlarging methods and their application
- Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
- Title not available (Why is that?)
- A fast preconditioner for the incompressible Navier-Stokes equations
- Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
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)
