Sparse QR factorization on a massively parallel computer

DOI10.1007/BF00155801zbMath1187.65047MaRDI QIDQ973426

Steven G. Kratzer

Publication date: 31 May 2010

Published in: The Journal of Supercomputing (Search for Journal in Brave)

zbMATH Keywords

sparse matriceslinear algebraParallel computing

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Theory of software (68N99)

Related Items (1)

A survey of direct methods for sparse linear systems

Uses Software

• LSQR
• SPARSPAK
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Parallel Cholesky factorization on a shared-memory multiprocessor
• Implementation of some concurrent algorithms for matrix factorization
• Parallel implementation of multifrontal schemes
• Reordering sparse matrices for parallel elimination
• Solution of sparse linear least squares problems using Givens rotations
• The natural factor formulation of the stiffness for the matrix displacement method
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• The Role of Elimination Trees in Sparse Factorization
• On Row and Column Orderings for Sparse Least Squares Problems
• Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations
• Application of Dense Householder Transformation to a Sparse Matrix
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Parallel Algorithms for Sparse Linear Systems
• Highly Parallel Sparse Cholesky Factorization

This page was built for publication: Sparse QR factorization on a massively parallel computer