Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
From MaRDI portal
Publication:1371662
DOI10.1007/BF02510239zbMath0883.65035MaRDI QIDQ1371662
Per Christian Hansen, Ahmed H. Sameh, Zahari Zlatev, Tzvetan Ostromsky
Publication date: 29 March 1998
Published in: BIT (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Uses Software
Cites Work
- Parallel sparse QR factorization on shared memory architectures
- Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
- Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
- Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
- Solution of sparse linear least squares problems using Givens rotations
- Comparison of two pivotal strategies in sparse plane rotations
- Pivot selection and row ordering in Givens reduction on sparse matrices
- A coarse-grained parallel QR-factorization algorithm for sparse least squares problems
- A review of frontal methods for solving linear systems
- A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
- Improving the numerical stability and the performance of a parallel sparse solver
- Numerical methods for solving linear least squares problems
- Sparse matrix test problems
- Some Design Features of a Sparse Matrix Code
- Row Ordering for a Sparse QR Decomposition
- Symbolic Givens Reduction and Row-Ordering in Large Sparse Least Squares Problems
- Least Squares Computations by Givens Transformations Without Square Roots
- A Note on the Least Squares Solution of a Band System of Linear Equations by Householder Reductions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
