Pages that link to "Item:Q1102707"
From MaRDI portal
The following pages link to Solving large and sparse linear least-squares problems by conjugate gradient algorithms (Q1102707):
Displaying 13 items.
- Block conjugate gradient algorithms for least squares problems (Q507984) (← links)
- Preconditioned conjugate gradient methods for the solution of indefinite least squares problems (Q652558) (← links)
- A conjugate gradient algorithm for sparse linear inequalities (Q915387) (← links)
- A survey of the advances in the exploitation of the sparsity in the solution of large problems (Q1099926) (← links)
- Solving large and sparse linear least-squares problems by conjugate gradient algorithms (Q1102707) (← links)
- A note on the SOR and CG methods for large least squares problems (Q1124276) (← links)
- Comparison of two pivotal strategies in sparse plane rotations (Q1164377) (← links)
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming (Q1349146) (← links)
- Solving large linear least squares problems with linear equality constraints (Q2098770) (← links)
- A class of incomplete orthogonal factorization methods. II: Implemetation and results (Q2568630) (← links)
- Krylov subspace estimation (Q2706471) (← links)
- (Q3819895) (← links)
- Solving Large Sparse Nonlinear Programs Using GRG (Q3993662) (← links)
