Pages that link to "Item:Q5185902"
From MaRDI portal
The following pages link to Incomplete Methods for Solving $A^T Ax = b$ (Q5185902):
Displaying 16 items.
- Preconditioned GMRES methods for least squares problems (Q946857) (← links)
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming (Q1349146) (← links)
- Accurate solutions of product linear systems associated with rank-structured matrices (Q1631422) (← links)
- A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems (Q1871426) (← links)
- A modified SSOR-like preconditioner for non-Hermitian positive definite matrices (Q1995946) (← links)
- Solving large linear least squares problems with linear equality constraints (Q2098770) (← links)
- Hierarchical orthogonal factorization: sparse least squares problems (Q2147465) (← links)
- Incomplete hyperbolic Gram-Schmidt-based preconditioners for the solution of large indefinite least squares problems (Q2448357) (← links)
- A class of incomplete orthogonal factorization methods. II: Implemetation and results (Q2568630) (← links)
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations (Q2831075) (← links)
- Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix (Q3449796) (← links)
- SOLVING SPARSE LEAST SQUARES PROBLEMS WITH PRECONDITIONED CGLS METHOD ON PARALLEL DISTRIBUTED MEMORY COMPUTERS (Q4242704) (← links)
- Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems (Q5028552) (← links)
- Hierarchical Orthogonal Factorization: Sparse Square Matrices (Q5028554) (← links)
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems (Q5066598) (← links)
- Preconditioners for Krylov subspace methods: An overview (Q6144043) (← links)
