A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
From MaRDI portal
(Redirected from Publication:1625762)
Cholesky factorizationpreconditioningiterative solversSchur complementaugmented systemincomplete factorizationsdense rowslarge-scale linear least squares problems
Numerical mathematical programming methods (65K05) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)
Recommendations
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- Preconditioning linear least-squares problems by identifying a basis matrix
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- Strengths and Limitations of Stretching for Least-squares Problems with Some Dense Rows
- Preconditioned GMRES methods for least squares problems
- On the choice of solution subspace for nonstationary iterated Tikhonov regularization
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Preconditioners for nonsymmetric linear systems with low-rank skew-symmetric part
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Numerical Methods for Large Sparse Linear Least Squares Problems
Cites work
- scientific article; zbMATH DE number 992796 (Why is no real title available?)
- scientific article; zbMATH DE number 4215266 (Why is no real title available?)
- scientific article; zbMATH DE number 554736 (Why is no real title available?)
- scientific article; zbMATH DE number 1047679 (Why is no real title available?)
- A General Updating Algorithm for Constrained Linear Least Squares Problems
- A Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems
- A modified Schur-complement method for handling dense columns in interior-point methods for linear programming
- A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
- A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming
- Adaptive filtering. Algorithms and practical implementation.
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- An out-of-core sparse Cholesky solver
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Cholesky-like factorization of symmetric indefinite matrices and orthogonalization with respect to bilinear forms
- Computational experience with a primal-dual interior point method for linear programming
- Design of a multicore sparse Cholesky factorization using DAGs
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Incomplete Cholesky Factorizations with Limited Memory
- Iterative solution of symmetric quasi-definite linear systems
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- On positive semidefinite modification schemes for incomplete Cholesky factorization
- On signed incomplete Cholesky factorization preconditioners for saddle-point systems
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- On the inverse of the autocovariance matrix for a general moving average process
- Parallel iterative methods for sparse linear systems
- Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
- Preconditioning techniques for large linear systems: A survey
- Solution of Sparse Indefinite Systems of Linear Equations
- Solution of sparse linear least squares problems using Givens rotations
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- Splitting dense columns in sparse linear systems
- Symmetric Quasidefinite Matrices
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- The University of Florida sparse matrix collection
- Unsymmetric positive definite linear systems
- Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
Cited in
(10)- 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
- Approximating sparse Hessian matrices using large-scale linear least squares
- 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
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Matrix stretching for sparse least squares problems
- Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement
- General-purpose preconditioning for regularized interior point methods
- Prestructuring sparse matrices with dense rows and columns via null space methods.
Describes a project that uses
Uses Software
This page was built for publication: A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1625762)
