Preconditioning linear least-squares problems by identifying a basis matrix
From MaRDI portal
Publication:3449796
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)
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
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 88927 (Why is no real title available?)
- scientific article; zbMATH DE number 1226271 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
- A network programming approach in solving Darcy's equations by mixed finite-element methods
- A theory of pseudoskeleton approximations
- Algorithm 915: SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization
- Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- How to Make the Lanczos Algorithm Converge Slowly
- How to find a good submatrix
- Incomplete Methods for Solving $A^T Ax = b$
- Iterative solution of symmetric quasi-definite linear systems
- MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
- Mixed and Hybrid Finite Element Methods
- Null space algorithm and spanning trees in solving Darcy's equation
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- Polynomial based iteration methods for symmetric linear systems
- Preconditioners for least squares problems by LU factorization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Semi-optimal bases for linear dependencies
- Shortest path methods: A unifying approach
- Solution of Sparse Indefinite Systems of Linear Equations
- Solution of sparse rectangular systems using LSQR and Craig
- Some Properties of Symmetric Quasi-Definite Matrices
- Stability analysis of the method of seminormal equations for linear least squares problems
- Symmetric Quasidefinite Matrices
- The University of Florida sparse matrix collection
- The elimination form of the inverse and its application to linear programming
- The maximal-volume concept in approximation by low-rank matrices
- Towards a Generalized Singular Value Decomposition
Cited in
(20)- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
- Rectangular maximum-volume submatrices and their applications
- On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
- Efficient solution of parameter identification problems with $H^1$ regularization
- 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
- Preconditioned iterative methods for solving linear least squares problems
- Greedy block extended Kaczmarz method for solving the least squares problems
- Some comments on preconditioning for normal equations and least squares
- A block-preconditioner for a special regularized least-squares problem
- Are sketch-and-precondition least squares solvers numerically stable?
- Subset selection for matrices with fixed blocks
- The effect of coherence on sampling from matrices with orthonormal columns, and preconditioned least squares problems
- A matrix-free preconditioner for sparse symmetric positive definite systems and least-squares problems
- Implementation of an interior point method with basis preconditioning
- A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems
- Greville's method for preconditioning least squares problems
- Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems
- Preconditioners for Krylov subspace methods: An overview
Describes a project that uses
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)
