Sparse QR factorization on a massively parallel computer
From MaRDI portal
Publication:973426
DOI10.1007/BF00155801zbMATH Open1187.65047MaRDI QIDQ973426FDOQ973426
Authors: Steven G. Kratzer
Publication date: 31 May 2010
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Recommendations
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Parallel algorithms in computer science (68W10) Theory of software (68N99)
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- The Role of Elimination Trees in Sparse Factorization
- Parallel Algorithms for Sparse Linear Systems
- On Row and Column Orderings for Sparse Least Squares Problems
- Implementation of some concurrent algorithms for matrix factorization
- Parallel implementation of multifrontal schemes
- The natural factor formulation of the stiffness for the matrix displacement method
- Title not available (Why is that?)
- Solution of sparse linear least squares problems using Givens rotations
- Parallel Cholesky factorization on a shared-memory multiprocessor
- Highly Parallel Sparse Cholesky Factorization
- Reordering sparse matrices for parallel elimination
- Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations
- Application of Dense Householder Transformation to a Sparse Matrix
Cited In (4)
Uses Software
This page was built for publication: Sparse QR factorization on a massively parallel computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973426)