A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization

DOI10.1137/0611028zbMath0711.65017OpenAlexW1996292746MaRDI QIDQ3497118

Pen-Chung Yew, Timothy A. Davis

Publication date: 1990

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0611028

zbMATH Keywords

LU factorizationmultiprocessorsParallel implementationpivot strategyparallel LU decompositionvector processorsnonsymmetric sparse matricesupdating steps

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (4)

A locally optimized reordering algorithm and its application to a parallel sparse linear system solver ⋮ Design and Implementation of a Parallel Markowitz Threshold Algorithm ⋮ A survey of direct methods for sparse linear systems ⋮ The impact of high-performance computing in the solution of linear systems: Trends and problems

Uses Software

• BLAS
• Harwell-Boeing sparse matrix collection
• Y12M

This page was built for publication: A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization