Pages that link to "Item:Q3694540"
From MaRDI portal
The following pages link to Numerical Methods for Large Sparse Linear Least Squares Problems (Q3694540):
Displaying 30 items.
- High-performance numerical algorithms and software for structured total least squares (Q556259) (← links)
- The sagitta method for solving linear programs (Q703904) (← links)
- On iterative algorithms for linear least squares problems with bound constraints (Q756372) (← links)
- Large sparse numerical optimization (Q792069) (← links)
- Integration of the Monte Carlo covariance estimation strategy into tailored solution procedures for large-scale least squares problems (Q871600) (← links)
- Preconditionings and splittings for rectangular systems (Q917216) (← links)
- The solution of large-scale least-squares problems on supercomputers (Q918420) (← links)
- Householder reflections versus Givens rotations in sparse orthogonal decomposition (Q1089725) (← 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 direct method for sparse least squares problems with lower and upper bounds (Q1112557) (← links)
- A parallel projection method for overdetermined nonlinear systems of equations (Q1208707) (← links)
- A stationary iterative pseudoinverse algorithm (Q1267019) (← links)
- Sparse linear least squares problems in optimization (Q1363062) (← links)
- Matrix enlarging methods and their application (Q1371659) (← links)
- Solving sparse linear least-squares problems on some supercomputers by using large dense blocks (Q1371662) (← links)
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
- An algorithm for solving sparse nonlinear least squares problems (Q1822462) (← links)
- Solving large linear least squares problems with linear equality constraints (Q2098770) (← links)
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method (Q3026741) (← links)
- Modified Lanczos method for solving large sparse linear systems (Q3136843) (← links)
- (Q3349880) (← links)
- The theoretical aspects of the generalized conjugate gradient method pplied to least squares problems (Q3486735) (← links)
- Karmarkar's projective method for linear programming: a computational survey (Q3491310) (← links)
- Stopping Criteria for the Iterative Solution of Linear Least Squares Problems (Q3561186) (← links)
- On Large Scale Nonlinear Least Squares Calculations (Q4725597) (← links)
- (Q4868585) (← links)
- Solution of large‐scale weighted least‐squares problems (Q5317834) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
