A parallel algorithm for functions of triangular matrices

Ç K. Koç, B. Bakkaloǧlu

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


We present a new parallel algorithm for computing arbitrary functions of triangular matrices. The presented algorithm is the first one to date requiring polylogarithmic time, and computes an arbitrary function of an n×n triangular matrix in O(log3 n) time using O(n6) processors. The algorithm requires the eigenvalues of the input matrix be distinct, and makes use of the commutativity relationship between the input and output matrices.

Original languageEnglish (US)
Pages (from-to)85-92
Number of pages8
JournalComputing (Vienna/New York)
Issue number1
StatePublished - Jan 1 1996
Externally publishedYes


  • Divide and conquer
  • Matrix functions
  • Parlett's algorithm

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Numerical Analysis
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computational Mathematics


Dive into the research topics of 'A parallel algorithm for functions of triangular matrices'. Together they form a unique fingerprint.

Cite this