Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
From MaRDI portal
Cited in
(17)- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- A survey of direct methods for sparse linear systems
- Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks
- Sparse linear least-squares problems
- Sparse linear problems and the least squares method
- Computing a Sparse Basis for the Null Space
- Conical projection algorithms for linear programming
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- Rank and null space calculations using matrix decomposition without column interchanges
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A direct method for sparse least squares problems with lower and upper bounds
- Matrix stretching for sparse least squares problems
- Approximation by cubic C^ 1-splines on arbitrary triangulations
- Fast orthogonal decomposition of rank deficient Toeplitz matrices
- Solving large linear least squares problems with linear equality constraints
- On stable least squares solution to the system of linear inequalities
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
This page was built for publication: Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3942314)
