Parallel sparse Gaussian elimination with partial pivoting

DOI10.1007/BF02023054zbMath0716.90078MaRDI QIDQ753685

D. Kharzeev

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

factorizationparallel algorithmmultiprocessorpartial pivotingsparse nonsymmetric matrix

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)

Related Items

On the row merge tree for sparse LU factorization with partial pivoting ⋮ Design and Implementation of a Parallel Markowitz Threshold Algorithm ⋮ A survey of direct methods for sparse linear systems

Uses Software

• Harwell-Boeing sparse matrix collection
• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational models and task scheduling for parallel sparse Cholesky factorization
• Parallel implementation of multifrontal schemes
• Solution of sparse positive definite systems on a shared-memory multiprocessor
• Multiprocessing a sparse matrix code on the Alliant FX/8
• The Multifrontal Solution of Unsymmetric Sets of Linear Equations
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• A compact row storage scheme for Cholesky factors using elimination trees
• On General Row Merging Schemes for Sparse Givens Transformations
• Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
• A Data Structure for Sparse $QR$ and $LU$ Factorizations
• Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
• On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices
• Sparse matrix test problems
• The Evolution of the Minimum Degree Ordering Algorithm
• An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices
• A Data Structure for Parallel L/U Decomposition
• A New Implementation of Sparse Gaussian Elimination
• Computing the Minimum Fill-In is NP-Complete
• An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
• Nested Dissection of a Regular Finite Element Mesh

This page was built for publication: Parallel sparse Gaussian elimination with partial pivoting