Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
From MaRDI portal
Recommendations
- Matrix stretching for sparse least squares problems
- scientific article; zbMATH DE number 4041162
- Sparse linear problems and the least squares method
- Sparse linear least squares problems in optimization
- Sparse Approximate Solutions to Linear Systems
- Strengths and Limitations of Stretching for Least-squares Problems with Some Dense Rows
- An algorithm for solving sparse nonlinear least squares problems
- scientific article; zbMATH DE number 1153374
- scientific article; zbMATH DE number 778128
- Sparse total least squares: analysis and greedy algorithms
Cites work
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
- A General Updating Algorithm for Constrained Linear Least Squares Problems
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- An Approximate Minimum Degree Ordering Algorithm
- Approximation algorithms for combinatorial problems
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
- Matrix enlarging methods and their application
- Matrix stretching for sparse least squares problems
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- On positive semidefinite modification schemes for incomplete Cholesky factorization
- Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
- Partitioning mathematical programs for parallel solution
- Pivoting strategies for tough sparse indefinite systems
- Reducibility among combinatorial problems
- Remarks on implementation of O ( n 1/2 τ) assignment algorithms
- Solution of sparse linear least squares problems using Givens rotations
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
- Splitting dense columns in sparse linear systems
- SuperLU_DIST
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- The University of Florida sparse matrix collection
- Using Perturbed QR Factorizations to Solve Linear Least-Squares Problems
Cited in
(17)- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems
- A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- Matrix stretching for sparse least squares problems
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- Dynamic Sparsing in Stiff Extrapolation Methods
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement
- 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
- Approximating sparse Hessian matrices using large-scale linear least squares
- Optimized five-by-five block preconditioning for efficient GMRES convergence in curvature-based image deblurring
- Sparse linear least-squares problems
- On the greedy coordinate descent methods for solving large linear least-squares problems
- Optimizing convergence: GMRES preconditioner for Darcy flow problem in a fracture network
- A new approach for linear systems of the form (A + UU^T)x = b
This page was built for publication: Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230611)
