The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
DOI10.1145/3014057zbMATH Open1380.65064OpenAlexW2521512416WikidataQ113310147 ScholiaQ113310147MaRDI QIDQ3133587FDOQ3133587
J. A. Scott, Nicholas I. M. Gould
Publication date: 5 February 2018
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://centaur.reading.ac.uk/70342/1/ls_study_toms.pdf
Recommendations
- Sparse Preconditioned Iterative Methods for Dense Linear Systems
- scientific article
- A new preconditioning technique for solving large sparse linear systems
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
- Preconditioners for rank deficient least squares problems
- A numerical study of optimized sparse preconditioners
- Sparsity preserving preconditioners for linear systems in interior-point methods
sparse matricespreconditioningnormal equationsiterative solversaugmented systemdirect solversleast-squares problems
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08)
Cited In (24)
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
- Optimization of random feature method in the high-precision regime
- Rational approximation preconditioners for sparse linear systems.
- New preconditioners applied to linear programming and the compressive sensing problems
- Approximating sparse Hessian matrices using large-scale linear least squares
- MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- Optimal preconditioners of a given sparsity pattern
- Efficient solution of parameter identification problems with $H^1$ regularization
- Preconditioners for Krylov subspace methods: An overview
- An Empirical Analysis of the Performance of Preconditioners for SPD Systems
- Preconditioners for rank deficient least squares problems
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
- A Note on Performance Profiles for Benchmarking Software
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
- Solving large linear least squares problems with linear equality constraints
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods
- A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
- A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- Preconditioners for least squares problems by LU factorization
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
Uses Software
This page was built for publication: The State-of-the-Art of Preconditioners 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 Q3133587)
