LU decomposition optimized for a parallel computer with a hierarchical distributed memory

DOI10.1016/0167-8191(92)90010-5zbMath0757.65029OpenAlexW1995111642MaRDI QIDQ1201009

Antony N. Beris, Scott Stark

Publication date: 17 January 1993

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90010-5

zbMATH Keywords

optimal performancedense systemsBBN TC2000 parallel computerefficient hybrid parallel block LU decomposition procedureMIMD architecture with distributed memory

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (2)

Dense linear system: A parallel self-verified solver ⋮ UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS

Uses Software

• LAPACK

This page was built for publication: LU decomposition optimized for a parallel computer with a hierarchical distributed memory