A parallel algorithm for functions of triangular matrices

DOI10.1007/BF02238360MaRDI QIDQ1919129zbMATH OpenOpenAlexFDO

Authors B. Bakkaloğlu, Çetin Kaya Koç

Publication date 20 February 1997

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02238360

zbMATH Keywords

complexityfunctions for triangular matricesparallel algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Review text

Theoretical work about complexity. It is shown that the problem of the title can be solved in \(O(\log^3n)\) time using \(O(n^6)\) processors. No mentioning of storage and communication.

Cites work

• A fast algorithm for evaluating the matrix polynomial I+A+. . .+A/sup N-1/
• A recurrence among the elements of functions of triangular matrices
• Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
• Explicit functional calculus
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3342967 (Why is no real title available?)

Cited in

(3)

• On the parallel Risch algorithm (III)
• Efficient parallel Gauss-Doolittle matrix triangulation
• Efficient Parallel Algorithm for Constructing a Unit Triangular Matrix with Prescribed Singular Values

Describes a project that uses

Uses Software

• Algorithm 432

This page was built for publication: A parallel algorithm for functions of triangular matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919129)