Sparse QR factorization in MATLAB
From MaRDI portal
Publication:4371567
DOI10.1145/174603.174408zbMath0888.65022OpenAlexW2050324476WikidataQ113310486 ScholiaQ113310486MaRDI QIDQ4371567
Publication date: 25 January 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1994-20/
MATLABiterative refinementsparse QR factorizationsparse linear least squares problemsmultifrontral method
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A stable primal-dual approach for linear programming under nondegeneracy assumptions ⋮ Solution of sparse rectangular systems using LSQR and Craig ⋮ An efficient algorithm for sparse null space basis problem using ABS methods ⋮ Matrix stretching for sparse least squares problems ⋮ Block computation and representation of a sparse nullspace basis of a rectangular matrix ⋮ Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic ⋮ An Iteration for Indefinite Systems and Its Application to the Navier--Stokes Equations ⋮ Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing ⋮ A survey of direct methods for sparse linear systems ⋮ Solving semidefinite programs using preconditioned conjugate gradients ⋮ SPARSE-QR
Uses Software
