A fully parallel symmetric matrix transformation

  • Ayse Kiper
Workshop 09: Parallel Numerical Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1300)


A parallel algorithm for the transformation LALT of an nxn symmetric A through a nonsingular triangular L is presented. Speedup and efficiency successively are of O((n3+n2)/(1+[log n])) and O(1/(1+[log n])) with O(1+[log n]) parallel time.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Ayse Kiper
    • 1
  1. 1.Department of Computer EngineeringMiddle East Technical UniversityAnkaraTurkey

Personalised recommendations