Pages that link to "Item:Q3314860"
From MaRDI portal
The following pages link to A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems (Q3314860):
Displaying 11 items.
- The solution of large-scale least-squares problems on supercomputers (Q918420) (← links)
- Approximation by cubic \(C^ 1\)-splines on arbitrary triangulations (Q1077650) (← links)
- Householder reflections versus Givens rotations in sparse orthogonal decomposition (Q1089725) (← links)
- Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks (Q1098761) (← 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)
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems (Q1107277) (← links)
- A parallel projection method for overdetermined nonlinear systems of equations (Q1208707) (← links)
- Fitting scattered data on sphere-like surfaces using spherical splines (Q1815872) (← links)
- An algorithm for solving sparse nonlinear least squares problems (Q1822462) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
