Technical Report 246-1990

Title

Parallel Matrix Inversion on Interconnection Networks

Authors

Andreas Schikarski and Dorothea Wagner

Source

The report may be requested from our secretary Gabriele Klink, email: klink@math.tu-berlin.de

Classification

not available

Keywords

not available

Abstract

The inversion of triangular matrices on a hypercube and on a perfect shuffle computer is considered. For both networks we show how the inverse of a triangular n imes n-matrix can be computed in O(log²n) time in comparison to the best known PRAM algorithm solving this problem, even if the perfect shuffle computer is used which is a bounded-degree network.