Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
From MaRDI portal
Publication:5230611
DOI10.1137/18M1181353zbMath1420.65019OpenAlexW2802225997MaRDI QIDQ5230611
Publication date: 28 August 2019
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1181353
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems, Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement, A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems, A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block, On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems, A new block preconditioner for weighted Toeplitz regularized least-squares problems, On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Splitting dense columns in sparse linear systems
- Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
- Solution of sparse linear least squares problems using Givens rotations
- Approximation algorithms for combinatorial problems
- Matrix enlarging methods and their application
- Partitioning mathematical programs for parallel solution
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
- On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
- Matrix stretching for sparse least squares problems
- On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization
- The university of Florida sparse matrix collection
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- Pivoting strategies for tough sparse indefinite systems
- Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems
- A General Updating Algorithm for Constrained Linear Least Squares Problems
- Remarks on implementation of O ( n 1/2 τ) assignment algorithms
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- An Approximate Minimum Degree Ordering Algorithm
- Reducibility among Combinatorial Problems
- HSL_MI28
- SuperLU_DIST
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
