A parallel algorithm for functions of triangular matrices

Ç K. Koç, Bertan Bakkaloglu

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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)
Volume57
Issue number1
StatePublished - 1996
Externally publishedYes

Fingerprint

Triangular matrix
Parallel algorithms
Parallel Algorithms
Commutativity
Arbitrary
Eigenvalue
Distinct
Computing
Output
Relationships

Keywords

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

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

A parallel algorithm for functions of triangular matrices. / Koç, Ç K.; Bakkaloglu, Bertan.

In: Computing (Vienna/New York), Vol. 57, No. 1, 1996, p. 85-92.

Research output: Contribution to journalArticle

@article{118a863f305745698c1ca132ed39a57d,
title = "A parallel algorithm for functions of triangular matrices",
abstract = "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.",
keywords = "Divide and conquer, Matrix functions, Parlett's algorithm",
author = "Ko{\cc}, {{\cC} K.} and Bertan Bakkaloglu",
year = "1996",
language = "English (US)",
volume = "57",
pages = "85--92",
journal = "Computing",
issn = "0010-485X",
publisher = "Springer Wien",
number = "1",

}

TY - JOUR

T1 - A parallel algorithm for functions of triangular matrices

AU - Koç, Ç K.

AU - Bakkaloglu, Bertan

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

KW - Divide and conquer

KW - Matrix functions

KW - Parlett's algorithm

UR - http://www.scopus.com/inward/record.url?scp=0029695377&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029695377&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0029695377

VL - 57

SP - 85

EP - 92

JO - Computing

JF - Computing

SN - 0010-485X

IS - 1

ER -