DocumentCode :
814424
Title :
Hybrid algorithm for the computation of the matrix polynomial I+A+···+AN-1
Author :
Dimitrov, Vassil ; Cooklev, Todor
Author_Institution :
Center for Comput.-Aided Design, Tech. Univ., Plovdiv, Bulgaria
Volume :
42
Issue :
7
fYear :
1995
fDate :
7/1/1995 12:00:00 AM
Firstpage :
377
Lastpage :
380
Abstract :
A new method for computing the matrix polynomial is proposed. The comparison demonstrates that this is the most efficient technique at the moment. Furthermore, it is argued that the approach is optimal in the framework of the discussed algorithms. The algorithm is recursive and it can be viewed as resulting from a new number system
Keywords :
computational complexity; matrix multiplication; polynomial matrices; hybrid algorithm; matrix polynomial; number system; recursive algorithm; Circuits; Design automation; Graph theory; Polynomials;
fLanguage :
English
Journal_Title :
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
Publisher :
ieee
ISSN :
1057-7122
Type :
jour
DOI :
10.1109/81.401149
Filename :
401149
Link To Document :
بازگشت