Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods
From MaRDI portal
Publication:4594173
DOI10.1137/16M1108339zbMath1377.65050MaRDI QIDQ4594173
Publication date: 17 November 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
preconditioningsparse matricesnumerical experimentconjugate gradientsleast squares problemsincomplete factorizations
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Preconditioners for iterative methods (65F08)
Related Items
Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement, A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows, A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems, A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block, A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations, A discrete least squares collocation method for two-dimensional nonlinear time-dependent partial differential equations, Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems, Solving large linear least squares problems with linear equality constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Splitting dense columns in sparse linear systems
- Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
- Fehleranalyse für die Gauß-Elimination zur Berechnung der Lösung minimaler Länge
- Solution of sparse linear least squares problems using Givens rotations
- A direct method for the solution of sparse linear least squares problems
- Fitting linear relationships. A history of the calculus of observations 1750-1900
- Matrix enlarging methods and their application
- A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Matrix stretching for sparse least squares problems
- On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization
- Adaptive Filtering
- The university of Florida sparse matrix collection
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- Solution of Sparse Underdetermined Systems of Linear Equations
- A Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems
- Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems
- A General Updating Algorithm for Constrained Linear Least Squares Problems
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- Updating the Inverse of a Matrix
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Solution of Sparse Indefinite Systems of Linear Equations
- On the inverse of the autocovariance matrix for a general moving average process
- A modified Schur-complement method for handling dense columns in interior-point methods for linear programming
- Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems
- HSL_MI28
- The least squares problem and pseudo-inverses
- Methods of conjugate gradients for solving linear systems
- Enlargement Methods for Computing the Inverse Matrix
