Numerical Methods for Large Sparse Linear Least Squares Problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4041162
- Sparse linear problems and the least squares method
- scientific article; zbMATH DE number 1153374
- An algorithm for solving sparse nonlinear least squares problems
- Hybrid methods for large sparse nonlinear least squares
- Methods for large scale total least squares problems
- scientific article; zbMATH DE number 3850364
- scientific article; zbMATH DE number 3986524
- Iterative algorithms and software for solving large sparse linear systems
- scientific article; zbMATH DE number 549931
Cited in
(39)- scientific article; zbMATH DE number 3988613 (Why is no real title available?)
- Householder reflections versus Givens rotations in sparse orthogonal decomposition
- scientific article; zbMATH DE number 554733 (Why is no real title available?)
- A survey of direct methods for sparse linear systems
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- scientific article; zbMATH DE number 712354 (Why is no real title available?)
- On iterative algorithms for linear least squares problems with bound constraints
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
- Solution of large‐scale weighted least‐squares problems
- The sagitta method for solving linear programs
- Numerical methods for least squares problems
- A stationary iterative pseudoinverse algorithm
- A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares Problems
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- On Large Scale Nonlinear Least Squares Calculations
- scientific article; zbMATH DE number 4096684 (Why is no real title available?)
- Integration of the Monte Carlo covariance estimation strategy into tailored solution procedures for large-scale least squares problems
- A direct method for sparse least squares problems with lower and upper bounds
- Preconditionings and splittings for rectangular systems
- The theoretical aspects of the generalized conjugate gradient method pplied to least squares problems
- The solution of large-scale least-squares problems on supercomputers
- Modified Lanczos method for solving large sparse linear systems
- Karmarkar's projective method for linear programming: a computational survey
- High-performance numerical algorithms and software for structured total least squares
- scientific article; zbMATH DE number 3901913 (Why is no real title available?)
- Stopping Criteria for the Iterative Solution of Linear Least Squares Problems
- Large sparse numerical optimization
- Solving large and sparse linear least-squares problems by conjugate gradient algorithms
- A parallel projection method for overdetermined nonlinear systems of equations
- Solving large linear least squares problems with linear equality constraints
- scientific article; zbMATH DE number 778128 (Why is no real title available?)
- An algorithm for solving sparse nonlinear least squares problems
- scientific article; zbMATH DE number 4201500 (Why is no real title available?)
- Matrix enlarging methods and their application
- scientific article; zbMATH DE number 4041162 (Why is no real title available?)
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
This page was built for publication: Numerical Methods for Large Sparse Linear Least Squares Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694540)
