Matrix stretching for sparse least squares problems
From MaRDI portal
Recommendations
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
- Sparse linear least squares problems in optimization
- scientific article; zbMATH DE number 778128
Cites work
- A General Updating Algorithm for Constrained Linear Least Squares Problems
- Matrix enlarging methods and their application
- Predicting fill for sparse orthogonal factorization
- Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
- Sparse QR factorization in MATLAB
- Splitting dense columns in sparse linear systems
Cited in
(7)- Iterative methods for least-square problems based on proper splittings.
- An iterative algorithm for a least squares solution of a matrix equation
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement
- Sparse linear least-squares problems
This page was built for publication: Matrix stretching for sparse least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760330)