A parallel algorithm for functions of triangular matrices
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.
scientific article; zbMATH DE number 912410
scientific article