Pages that link to "Item:Q1157668"
From MaRDI portal
The following pages link to A direct method for the solution of sparse linear least squares problems (Q1157668):
Displaying 19 items.
- The solution of large-scale least-squares problems on supercomputers (Q918420) (← links)
- Rank and null space calculations using matrix decomposition without column interchanges (Q1074304) (← 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)
- Sparse linear problems and the least squares method (Q1110269) (← links)
- An algorithmic approach for the analysis of extrapolated iterative schemes applied to least-squares problems (Q1112558) (← links)
- Solution of sparse linear least squares problems using Givens rotations (Q1152201) (← links)
- Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition (Q1156451) (← links)
- Comparison of two pivotal strategies in sparse plane rotations (Q1164377) (← links)
- Rank revealing \(LU\) factorizations (Q1200555) (← links)
- Tensor methods for large sparse systems of nonlinear equations (Q1290627) (← links)
- Strong rank revealing LU factorizations (Q1873693) (← links)
- Solving large linear least squares problems with linear equality constraints (Q2098770) (← links)
- Discrete least-squares finite element methods (Q2310100) (← links)
- Class of optimization algorithms for the solution of large nonlinear programming problems. I (Q4005332) (← links)
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods (Q4594173) (← links)
- Perturbation analysis of saddle-point problems (Q4978285) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
