Subcube matrix decomposition: A unifying view for LU factorization on multicomputers

DOI10.1016/0167-8191(94)90085-XMaRDI QIDQ1319524zbMATH OpenFDO

Authors Michele Angelaccio, Michele Colajanni

Publication date 13 September 1994

Published in Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

pivotingmulticomputersmeta-decompositionparallel LU factorization algorithmssubcube matrix decomposition

Mathematics Subject Classification ID

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

Cited in

(3)

• UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS
• EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK
• Block-cyclic matrix triangulation on the Cartesian product of star graphs

This page was built for publication: Subcube matrix decomposition: A unifying view for LU factorization on multicomputers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1319524)