DocumentCode :
974561
Title :
A fast algorithm for evaluating the matrix polynomial I+ A+. . .+AN-1
Author :
Lei, Li ; Nakamura, T.
Author_Institution :
Dept. of Inf. Sci., Hirosaki Univ., Japan
Volume :
39
Issue :
4
fYear :
1992
fDate :
4/1/1992 12:00:00 AM
Firstpage :
299
Lastpage :
300
Abstract :
D. Westreich (ibid., vol.36, no.1, p.162-4, 1989) gave a practical algorithm for the evaluation of the matrix polynomial I+A +A2+. . .+AN-1, which requires at most 3 log2N matrix multiplications. The authors present a new method, which only requires at most 2[log2 N]-1 matrix multiplications. The listing of a BASIC program is given
Keywords :
BASIC listings; mathematics computing; matrix algebra; polynomials; BASIC program; fast algorithm; matrix multiplications; matrix polynomial; Algorithm design and analysis; Analog integrated circuits; Information science; Matrix decomposition; Mechanical engineering; 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.129458
Filename :
129458
Link To Document :
بازگشت