A parallel algorithm for functions of triangular matrices (Q1919129)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 912410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallel algorithm for functions of triangular matrices |
scientific article; zbMATH DE number 912410 |
Statements
A parallel algorithm for functions of triangular matrices (English)
0 references
20 February 1997
0 references
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.
0 references
parallel algorithm
0 references
functions for triangular matrices
0 references
complexity
0 references
