A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
From MaRDI portal
Publication:1625762
DOI10.1007/S11075-018-0478-2zbMATH Open1406.65015OpenAlexW2792661099MaRDI QIDQ1625762FDOQ1625762
Publication date: 29 November 2018
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-018-0478-2
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- The university of Florida sparse matrix collection
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- Design of a Multicore Sparse Cholesky Factorization Using DAGs
- HSL_MI28
- Preconditioning techniques for large linear systems: A survey
- Symmetric Quasidefinite Matrices
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Parallel iterative methods for sparse linear systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Adaptive Filtering
- Incomplete Cholesky Factorizations with Limited Memory
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Splitting dense columns in sparse linear systems
- Computational experience with a primal-dual interior point method for linear programming
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- On positive semidefinite modification schemes for incomplete Cholesky factorization
- 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
- Iterative Solution of Symmetric Quasi-Definite Linear Systems
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
- Solution of sparse linear least squares problems using Givens rotations
- Unsymmetric positive definite linear systems
- An out-of-core sparse Cholesky solver
- A modified Schur-complement method for handling dense columns in interior-point methods for linear programming
- A General Updating Algorithm for Constrained Linear Least Squares Problems
- Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
- On the inverse of the autocovariance matrix for a general moving average process
- Cholesky-Like Factorization of Symmetric Indefinite Matrices and Orthogonalization with Respect to Bilinear Forms
- A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods
- On Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
Cited In (8)
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- Approximating sparse Hessian matrices using large-scale linear least squares
- Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement
- Solving large linear least squares problems with linear equality constraints
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods
- General-purpose preconditioning for regularized interior point methods
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
Uses Software
Recommendations
- On the choice of solution subspace for nonstationary iterated Tikhonov regularization 👍 👎
- Numerical Methods for Large Sparse Linear Least Squares Problems 👍 👎
- Preconditioned GMRES methods for least squares problems 👍 👎
- Preconditioners for nonsymmetric linear systems with low-rank skew-symmetric part 👍 👎
- Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix 👍 👎
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods 👍 👎
- Strengths and Limitations of Stretching for 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 👍 👎
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems 👍 👎
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems 👍 👎
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)
