Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations
From MaRDI portal
Publication:2831075
DOI10.1137/16M105890XzbMath1348.65066MaRDI QIDQ2831075
Publication date: 2 November 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
preconditioningsparse matricessparse linear systemsiterative solversincomplete factorizationsindefinite symmetric systems
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Linear equations (linear algebraic aspects) (15A06) Preconditioners for iterative methods (65F08)
Related Items
Hierarchical orthogonal factorization: sparse least squares problems, A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations, Some Comments on Preconditioning for Normal Equations and Least Squares, Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical stability of orthogonalization methods with a non-standard inner product
- Direct methods for sparse matrices
- Preconditioning techniques for nonsymmetric and indefinite linear systems
- Preconditioners for least squares problems by LU factorization
- Refining an approximate inverse
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- A class of incomplete orthogonal factorization methods. II: Implemetation and results
- Jordan-Elimination und Ausgleichung nach kleinsten Quadraten
- Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
- On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization
- LSRN: A Parallel Iterative Solver for Strongly Over- or Underdetermined Systems
- Preconditioned Iterative Methods for Solving Linear Least Squares Problems
- The university of Florida sparse matrix collection
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
- Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix
- The Role of Elimination Trees in Sparse Factorization
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- Yale sparse matrix package I: The symmetric codes
- Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization
- Predicting Structure in Sparse Matrix Computations
- CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
- A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
- Orderings for Factorized Sparse Approximate Inverse Preconditioners
- Ordering, Anisotropy, and Factored Sparse Approximate Inverses
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- Incomplete Methods for Solving $A^T Ax = b$
- HSL_MI28
- Elimination Structures for Unsymmetric Sparse $LU$ Factors
- Inner-Iteration Krylov Subspace Methods for Least Squares Problems
- The Theory of Elimination Trees for Sparse Unsymmetric Matrices
- A robust incomplete factorization preconditioner for positive definite matrices
- The least squares problem and pseudo-inverses
- The Transitive Reduction of a Directed Graph
- Methods of conjugate gradients for solving linear systems
