Matrix enlarging methods and their application
From MaRDI portal
Publication:1371659
DOI10.1007/BF02510237zbMath0883.65036MaRDI QIDQ1371659
Publication date: 13 November 1997
Published in: BIT (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems, Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods, Matrix stretching for sparse least squares problems, Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Splitting dense columns in sparse linear systems
- Solution of sparse linear least squares problems using Givens rotations
- Numerical methods for solving linear least squares problems
- On Row and Column Orderings for Sparse Least Squares Problems
- Modification of the minimum-degree algorithm by multiple elimination
- Numerical Methods for Large Sparse Linear Least Squares Problems
- Predicting fill for sparse orthogonal factorization
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- Sparse matrix test problems
- Manipulation and Visualization of Sparse Matrices
- A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
- A modified Schur-complement method for handling dense columns in interior-point methods for linear programming
- On the Condition of the Linear Systems Associated with Discretized BVP<scp>s</scp> of ODE<scp>s</scp>