Sparse QR factorization on a massively parallel computer
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3963085 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- Application of Dense Householder Transformation to a Sparse Matrix
- Highly Parallel Sparse Cholesky Factorization
- Implementation of some concurrent algorithms for matrix factorization
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On Row and Column Orderings for Sparse Least Squares Problems
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations
- Parallel Algorithms for Sparse Linear Systems
- Parallel Cholesky factorization on a shared-memory multiprocessor
- Parallel implementation of multifrontal schemes
- Reordering sparse matrices for parallel elimination
- Solution of sparse linear least squares problems using Givens rotations
- The Role of Elimination Trees in Sparse Factorization
- The natural factor formulation of the stiffness for the matrix displacement method
Cited in
(4)
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)