Pages that link to "Item:Q3449796"
From MaRDI portal
The following pages link to Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix (Q3449796):
Displaying 10 items.
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
- Rectangular maximum-volume submatrices and their applications (Q1680300) (← links)
- On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems (Q2041935) (← links)
- Subset selection for matrices with fixed blocks (Q2066125) (← links)
- Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices (Q2114109) (← links)
- Implementation of an interior point method with basis preconditioning (Q2220915) (← links)
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices (Q2310401) (← links)
- Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations (Q2831075) (← links)
- Preconditioners for Krylov subspace methods: An overview (Q6144043) (← links)
- Greedy block extended Kaczmarz method for solving the least squares problems (Q6601141) (← links)
