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)

Full work available at URL https://doi.org/10.1016/0167-8191(94)90085-X

zbMATH Keywords

meta-decompositionmulticomputersparallel LU factorization algorithmspivotingsubcube matrix decomposition

Mathematics Subject Classification ID

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

Review text

A new unifying meta-decomposition, called subcube matrix decomposition allows to design decomposition independent parallel LU factorization algorithms. The same approach is also suitable to the factorization with pivoting.

Cited in

(3)

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

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)