Solving large linear least squares problems with linear equality constraints
From MaRDI portal
Publication:2098770
DOI10.1007/s10543-022-00930-2zbMath1505.65171arXiv2106.13142OpenAlexW4284691895MaRDI QIDQ2098770
Publication date: 22 November 2022
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.13142
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical optimization and variational techniques (65K10) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear least squares problems with additional constraints and an application to scattered data approximation
- Recursive least squares with linear constraints
- Bivariate least squares approximation with linear constraints
- Numerical study on incomplete orthogonal factorization preconditioners
- Modified incomplete orthogonal factorization methods using Givens rotations
- A direct method for the solution of sparse linear least squares problems
- A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- New parallel sparse direct solvers for multicore architectures
- Solution of sparse rectangular systems using LSQR and Craig
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- Numerical methods for solving linear least squares problems
- A class of incomplete orthogonal factorization methods. II: Implemetation and results
- The method of augmented regularized normal equations
- The university of Florida sparse matrix collection
- Algorithm 915, SuiteSparseQR
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
- ParILUT---A New Parallel Threshold ILU Factorization
- MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
- A General Updating Algorithm for Constrained Linear Least Squares Problems
- On the Method of Weighting for Equality-Constrained Least-Squares Problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- The Null Space Problem I. Complexity
- The Direct Solution of Weighted and Equality Constrained Least-Squares Problems
- Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
- Solution of Sparse Indefinite Systems of Linear Equations
- CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods
- Preconditioning Reduced Matrices
- 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
- Incomplete Methods for Solving $A^T Ax = b$
- Design of a Multicore Sparse Cholesky Factorization Using DAGs
- Numerical Methods in Matrix Computations
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- On the Numerical Solution of Constrained Least-Squares Problems
- Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems
- A class of incomplete orthogonal factorization methods. I: Methods and theories
