Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
From MaRDI portal
Recommendations
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- Preconditioners for least squares problems by LU factorization
- Preconditioned iterative methods for solving linear least squares problems
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Numerical Methods for Large Sparse Linear Least Squares Problems
Cites work
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
- A direct method for the solution of sparse linear least squares problems
- A General Updating Algorithm for Constrained Linear Least Squares Problems
- A modified Schur-complement method for handling dense columns in interior-point methods for linear programming
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming
- A Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- Adaptive filtering. Algorithms and practical implementation.
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Enlargement Methods for Computing the Inverse Matrix
- Fehleranalyse für die Gauß-Elimination zur Berechnung der Lösung minimaler Länge
- Fitting linear relationships. A history of the calculus of observations 1750-1900
- scientific article; zbMATH DE number 992796 (Why is no real title available?)
- scientific article; zbMATH DE number 88933 (Why is no real title available?)
- scientific article; zbMATH DE number 554736 (Why is no real title available?)
- scientific article; zbMATH DE number 781820 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Matrix enlarging methods and their application
- Matrix stretching for sparse least squares problems
- Methods of conjugate gradients for solving linear systems
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On positive semidefinite modification schemes for incomplete Cholesky factorization
- On the inverse of the autocovariance matrix for a general moving average process
- Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
- Solution of Sparse Indefinite Systems of Linear Equations
- Solution of sparse linear least squares problems using Givens rotations
- Solution of Sparse Underdetermined Systems of Linear Equations
- Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
- Splitting dense columns in sparse linear systems
- Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- The least squares problem and pseudo-inverses
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- The University of Florida sparse matrix collection
- Updating the Inverse of a Matrix
- Using Perturbed QR Factorizations to Solve Linear Least-Squares Problems
Cited in
(16)- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- Solving large linear least squares problems with linear equality constraints
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- A discrete least squares collocation method for two-dimensional nonlinear time-dependent partial differential equations
- New preconditioners applied to linear programming and the compressive sensing problems
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
- Sparse Preconditioned Iterative Methods for Dense Linear Systems
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations
- Least squares preconditioning for mixed methods with nonconforming trial spaces
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement
- Approximating sparse Hessian matrices using large-scale linear least squares
- Sparse linear least-squares problems
- Krylov iterative methods for linear least squares problems with linear equality constraints
This page was built for publication: Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594173)
