Sparse linear least-squares problems

DOI10.1017/S0962492924000059MaRDI QIDQ6964450zbMATH OpenFDO

Authors J. A. Scott, Miroslav Tuma

Publication date 4 July 2025

Published in Acta Numerica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

least-squareslinearsparse

Mathematics Subject Classification ID

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

• scientific article; zbMATH DE number 991430 (Why is no real title available?)
• scientific article; zbMATH DE number 992796 (Why is no real title available?)
• scientific article; zbMATH DE number 3163242 (Why is no real title available?)
• scientific article; zbMATH DE number 3523042 (Why is no real title available?)
• scientific article; zbMATH DE number 3546670 (Why is no real title available?)
• scientific article; zbMATH DE number 1226271 (Why is no real title available?)
• scientific article; zbMATH DE number 712354 (Why is no real title available?)
• scientific article; zbMATH DE number 1049347 (Why is no real title available?)
• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• scientific article; zbMATH DE number 2166998 (Why is no real title available?)
• scientific article; zbMATH DE number 3997027 (Why is no real title available?)
• scientific article; zbMATH DE number 781820 (Why is no real title available?)
• scientific article; zbMATH DE number 852525 (Why is no real title available?)
• scientific article; zbMATH DE number 1406968 (Why is no real title available?)
• scientific article; zbMATH DE number 1442000 (Why is no real title available?)
• scientific article; zbMATH DE number 3313812 (Why is no real title available?)
• scientific article; zbMATH DE number 3363343 (Why is no real title available?)
• scientific article; zbMATH DE number 3420184 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• scientific article; zbMATH DE number 4189084 (Why is no real title available?)
• scientific article; zbMATH DE number 3083851 (Why is no real title available?)
• A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
• A Data Structure for Sparse $QR$ and $LU$ Factorizations
• A Deflated Version of the Conjugate Gradient Algorithm
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations
• A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
• A Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems
• A Storage-Efficient WY Representation for Products of Householder Transformations
• A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
• A block algorithm for computing rank-revealing QR factorizations
• A class of efficient locally constructed preconditioners based on coarse spaces
• A class of incomplete orthogonal factorization methods. II: Implemetation and results
• A column approximate minimum degree ordering algorithm
• A compact row storage scheme for Cholesky factors using elimination trees
• A comparative study of null-space factorizations for sparse symmetric saddle point systems.
• A matrix-free preconditioner for sparse symmetric positive definite systems and least-squares problems
• A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
• A new sparse \(LDL^T\) solver using a posteriori threshold pivoting
• A note on error bounds for pseudo skeleton approximations of matrices
• A note on iterative refinement for seminormal equations
• A note on the LDL\(^{T}\) decomposition of matrices from saddle-point problems
• A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
• A preconditioned conjugate gradient approach to linear equality constrained minimization
• A regularized interior-point method for constrained linear least squares
• A robust incomplete Choleski-conjugate gradient algorithm
• A robust incomplete factorization preconditioner for positive definite matrices
• A software package for sparse orthogonal factorization and updating
• A spectral algorithm for envelope reduction of sparse matrices
• A spectral analysis of subspace enhanced preconditioners
• A survey of direct methods for sparse linear systems
• A theory of pseudoskeleton approximations
• Accelerating the solution of linear systems by iterative refinement in three precisions
• Accuracy and Stability of Numerical Algorithms
• Algorithm 1003: Mongoose, a graph coarsening and partitioning library
• Algorithm 836
• Algorithm 837
• Algorithm 915: SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization
• Algorithm 980: Sparse QR factorization on the GPU
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithms for Sparse Linear Systems
• An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• An Approximate Minimum Degree Ordering Algorithm
• An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations
• An algorithm for profile and wavefront reduction of sparse matrices
• An algorithm for symmetric indefinite linear systems
• An efficient analyse phase for element problems.
• An improved incomplete Cholesky factorization
• An out-of-core sparse Cholesky solver
• Approximate Gauss–Newton Methods for Nonlinear Least Squares Problems
• Are sketch-and-precondition least squares solvers numerically stable?
• Avoiding breakdown in incomplete factorizations in low precision arithmetic
• Balancing domain decomposition
• Block Gram-Schmidt algorithms and their stability properties
• Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
• Block preconditioners for linear systems in interior point methods for convex constrained optimization
• Block-iterative methods for consistent and inconsistent linear equations
• CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
• Communication avoiding rank revealing QR factorization with column pivoting
• Communication-optimal parallel and sequential QR and LU factorizations
• Comparison of two-level preconditioners derived from deflation, domain decomposition and multigrid methods
• Compressed Graphs and the Minimum Degree Algorithm
• Computing row and column counts for sparse \(QR\) and \(LU\) factorization
• Computing the block triangular form of a sparse matrix
• Condition numbers and equilibration of matrices
• Cones and Iterative Methods for Best Least Squares Solutions of Linear Systems
• Crout Versions of ILU for General Sparse Matrices
• Crout versions of ILU factorization with pivoting for sparse symmetric matrices
• Design of a multicore sparse Cholesky factorization using DAGs
• Developing robust incomplete Cholesky factorizations in half precision arithmetic
• Direct methods for sparse matrices
• Discrete inverse problems. Insight and algorithms.
• Efficiency of a Good But Not Linear Set Union Algorithm
• Exploiting lower precision arithmetic in solving symmetric positive definite linear systems and least squares problems
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• Extensions of the Augmented Block Cimmino Method to the Solution of Full Rank Rectangular Systems
• Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots
• Fast and forward stable randomized algorithms for linear least-squares problems
• Finding Exact and Approximate Block Structures for ILU Preconditioning
• Fine-grained multithreading for the multifrontal \(QR\) factorization of sparse matrices
• GMRES methods for least squares problems
• GMRES methods for tomographic reconstruction with an unmatched back projector
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Gauss on least-squares and maximum-likelihood estimation
• Generalized Nested Dissection
• Graph partitioning
• HILUCSI: Simple, robust, and fast multilevel ILU for large‐scale saddle‐point problems from PDEs
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• Hierarchical orthogonal factorization: sparse least squares problems
• Householder QR factorization with randomization for column pivoting (HQRRP)
• Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices
• Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
• Implicitly restarting the LSQR algorithm
• Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners
• Incomplete Methods for Solving $A^T Ax = b$
• Iterated preconditioned LSQR method for inverse problems on unstructured grids
• Iterative Krylov Methods for Large Linear Systems
• Iterative methods for least-square problems based on proper splittings.
• Iterative refinement of linear least squares solutions I
• Iterative solution of linear systems in the 20th century
• Iterative solution of symmetric quasi-definite linear systems
• Jordan-Elimination und Ausgleichung nach kleinsten Quadraten
• Krylov subspace methods. Principles and analysis.
• LSLQ: an iterative method for linear least-squares with an error minimization property
• LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• LSRN: A parallel iterative solver for strongly over- or underdetermined systems
• Least squares data fitting with applications
• Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
• M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions
• MA57---a code for the solution of sparse symmetric definite and indefinite systems
• MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
• Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
• Matrix stretching for sparse least squares problems
• Methods of conjugate gradients for solving linear systems
• Mixed precision algorithms in numerical linear algebra
• Modified incomplete orthogonal factorization methods using Givens rotations
• Multifrontal parallel distributed symmetric and unsymmetric solvers
• Multiple-rank modifications of a sparse Cholesky factorization
• Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
• Nested Dissection of a Regular Finite Element Mesh
• New parallel sparse direct solvers for multicore architectures
• Node Selection Strategies for Bottom-Up Sparse Matrix Ordering
• Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
• Note on the iterative refinement of least squares solution
• Numerical methods for least squares problems
• Numerical methods for solving linear least squares problems
• Numerical solution of saddle point problems
• Numerically aware orderings for sparse symmetric indefinite linear systems
• On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
• On General Row Merging Schemes for Sparse Givens Transformations
• On Rank-Revealing Factorisations
• On Row and Column Orderings for Sparse Least Squares Problems
• On fast factorization pivoting methods for sparse symmetric indefinite systems
• On positive semidefinite modification schemes for incomplete Cholesky factorization
• On selecting a maximum volume sub-matrix of a matrix and related problems
• On signed incomplete Cholesky factorization preconditioners for saddle-point systems
• On the Method of Weighting for Equality-Constrained Least-Squares Problems
• On the Numerical Solution of the Biharmonic Equation and the Role of Squaring Matrices for Preconditioning
• On the Sensitivity of Some Spectral Preconditioners
• On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
• On the augmented system approach to sparse least-squares problems
• PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems
• Perturbation theory for pseudo-inverses
• Pivoting strategies for tough sparse indefinite systems
• Preconditioned iterative methods for solving linear least squares problems
• Preconditioners for Krylov subspace methods: An overview
• Preconditioners for rank deficient least squares problems
• Preconditioning
• Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
• Predicting fill for sparse orthogonal factorization
• Predicting the structure of sparse orthogonal factors
• Priorconditioners for linear systems
• Pseudo-skeleton approximations with better accuracy estimates
• Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
• Randomized numerical linear algebra: Foundations and algorithms
• Rang revealing QR factorizations
• Rank and null space calculations using matrix decomposition without column interchanges
• Rank-Revealing QR Factorizations and the Singular Value Decomposition
• Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
• Rounding error analysis of the classical Gram-Schmidt orthogonalization process
• Roundoff error analysis of the CholeskyQR2 algorithm
• Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
• SYM-ILDL: Incomplete LDL\(^{\mathrm T}\) factorization of symmetric indefinite and skew-symmetric matrices
• Simple stopping criteria for the LSQR method applied to discrete ill-posed problems
• Solution of Sparse Indefinite Systems of Linear Equations
• Solution of augmented linear systems using orthogonal factorizations
• Solution of sparse linear least squares problems using Givens rotations
• Solution of sparse rectangular systems using LSQR and Craig
• Solving Generalized Least-Squares Problems with LSQR
• Solving large linear least squares problems with linear equality constraints
• Solving linear least squares problems by Gram-Schmidt orthogonalization
• Solving linear systems of the form $(A + \gamma UU^T)\, {\bf x} = {\bf b}$ by preconditioned iterative methods
• Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
• Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
• Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
• Some comments on preconditioning for normal equations and least squares
• Sparse Multifrontal Rank Revealing QR Factorization
• Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
• Sparsity Analysis of the QR Factorization
• Stability analysis of the method of seminormal equations for linear least squares problems
• Stopping Criteria for the Iterative Solution of Linear Least Squares Problems
• Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
• Strengths and Limitations of Stretching for Least-squares Problems with Some Dense Rows
• Structure-Preserving and Rank-Revealing QR-Factorizations
• Symmetric Quasidefinite Matrices
• The N‐Step Iteration Procedures
• The Factorization of Sparse Symmetric Indefinite Matrices
• The Minimum Degree Ordering with Constraints
• The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• The Role of Elimination Trees in Sparse Factorization
• The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
• The Use of Linear Graphs in Gauss Elimination
• The augmented block Cimmino distributed method
• The effect of coherence on sampling from matrices with orthonormal columns, and preconditioned least squares problems
• The elimination form of the inverse and its application to linear programming
• The importance of structure in incomplete factorization preconditioners
• The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
• The influence of relaxed supernode partitions on the multifrontal method
• The least squares problem and pseudo-inverses
• Theory of the motion of the celestial bodies moving around the Sun in conic sections
• Three-precision GMRES-based iterative refinement for least squares problems
• Towards Stable Mixed Pivoting Strategies for the Sequential and Parallel Solution of Sparse Symmetric Indefinite Systems
• Unitary Triangularization of a Nonsymmetric Matrix
• Updating preconditioners for modified least squares problems
• Updating the Inverse of a Matrix
• Using Perturbed QR Factorizations to Solve Linear Least-Squares Problems
• Weighted Matchings for Preconditioning Symmetric Indefinite Linear Systems
• \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code

Cited in

(1)

• Block conjugate gradient methods with error norm estimates for least squares problems

This page was built for publication: Sparse linear least-squares problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6964450)