A fast algorithm for evaluating the matrix polynomial I+A+. . .+A/sup N-1/
From MaRDI portal
Publication:4017651
DOI10.1109/81.129458zbMath0755.65043OpenAlexW2106256021MaRDI QIDQ4017651
Publication date: 16 January 1993
Published in: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/81.129458
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
A parallel algorithm for functions of triangular matrices ⋮ Computing the matrix sine and cosine simultaneously with a reduced number of products
This page was built for publication: A fast algorithm for evaluating the matrix polynomial I+A+. . .+A/sup N-1/