By Topic

Evaluating the matrix polynomial I+A+. . .+A N-1

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Westreich, D. ; Israel Aircraft Ind. Ltd., Yahub, Israel

A practical algorithm is described for the evaluation of the matrix polynomial I+A. . .+AN-1. The algorithm is based on the prime decomposition of NP, and requires at most 3log2(N) matrix multiplications. The method is applicable to all square matrices and is designed to minimize matrix additions. Thus, as the number of matrix additions and multiplications is minimized, the evaluation will be more accurate than that achieved by other approaches

Published in:

Circuits and Systems, IEEE Transactions on  (Volume:36 ,  Issue: 1 )