Preconditioning linear least-squares problems by identifying a basis matrix
From MaRDI portal
Publication:3449796
DOI10.1137/140975358zbMATH Open1325.65041OpenAlexW4299432195MaRDI QIDQ3449796FDOQ3449796
Authors: M. Arioli, Iain S. Duff 
Publication date: 30 October 2015
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140975358
Recommendations
- Preconditioners for least squares problems by LU factorization
- Preconditioned iterative methods for solving linear least squares problems
- Greville's method for preconditioning least squares problems
- Preconditioned GMRES methods for least squares problems
- Generalized approximate inverse preconditioners for least squares problems
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) 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)
Cites Work
- The University of Florida sparse matrix collection
- MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
- Symmetric Quasidefinite Matrices
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- A theory of pseudoskeleton approximations
- The maximal-volume concept in approximation by low-rank matrices
- How to find a good submatrix
- Mixed and Hybrid Finite Element Methods
- A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithm 915: SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization
- Solution of Sparse Indefinite Systems of Linear Equations
- Title not available (Why is that?)
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
- The elimination form of the inverse and its application to linear programming
- Shortest path methods: A unifying approach
- Preconditioners for least squares problems by LU factorization
- Towards a Generalized Singular Value Decomposition
- Solution of sparse rectangular systems using LSQR and Craig
- Some Properties of Symmetric Quasi-Definite Matrices
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- Semi-optimal bases for linear dependencies
- Iterative solution of symmetric quasi-definite linear systems
- Stability analysis of the method of seminormal equations for linear least squares problems
- A network programming approach in solving Darcy's equations by mixed finite-element methods
- Incomplete Methods for Solving $A^T Ax = b$
- How to Make the Lanczos Algorithm Converge Slowly
- Title not available (Why is that?)
- Polynomial based iteration methods for symmetric linear systems
- Null space algorithm and spanning trees in solving Darcy's equation
Cited In (20)
- Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems
- Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- Implementation of an interior point method with basis preconditioning
- Greedy block extended Kaczmarz method for solving the least squares problems
- Efficient solution of parameter identification problems with $H^1$ regularization
- Are sketch-and-precondition least squares solvers numerically stable?
- Some comments on preconditioning for normal equations and least squares
- The effect of coherence on sampling from matrices with orthonormal columns, and preconditioned least squares problems
- A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems
- On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems
- Preconditioners for Krylov subspace methods: An overview
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
- Subset selection for matrices with fixed blocks
- Rectangular maximum-volume submatrices and their applications
- Preconditioned iterative methods for solving linear least squares problems
- Greville's method for preconditioning least squares problems
- A block-preconditioner for a special regularized least-squares problem
- A matrix-free preconditioner for sparse symmetric positive definite systems and least-squares problems
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
Uses Software
This page was built for publication: Preconditioning linear least-squares problems by identifying a basis matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449796)
