Pages that link to "Item:Q5230611"
From MaRDI portal
The following pages link to Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems (Q5230611):
Displaying 7 items.
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
- On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems (Q2041935) (← links)
- A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems (Q2127524) (← links)
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block (Q2159428) (← links)
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems (Q5066598) (← links)
- Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement (Q5889340) (← links)
- On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems (Q6142558) (← links)
