Data-Parallel Sparse Factorization

DOI10.1137/S1064827594276412zbMath0911.65020MaRDI QIDQ4389260

John M. Conroy, Robert F. Lucas, Steven G. Kratzer, Aaron E. Naiman

Publication date: 12 May 1998

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

performanceparallel algorithmssparse linear systemsLU factorizationmultifrontal algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Design and Implementation of a Parallel Markowitz Threshold Algorithm, A survey of direct methods for sparse linear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel nested dissection
• Parallel implementation of multifrontal schemes
• Direct Methods for Sparse Matrices
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• Sparse matrix test problems
• Parallel Algorithms for Sparse Linear Systems
• Highly Parallel Sparse Cholesky Factorization
• Incomplete Nested Dissection for Solving n by n Grid Problems
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• The influence of relaxed supernode partitions on the multifrontal method