Cart (Loading....) | Create Account
Close category search window
 

Hybrid algorithm for the computation of the matrix polynomial using a fractal number system

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

2 Author(s)
Dimitrov, V. ; Dept. of Comput. Sci., Tech. Univ. of Plovdiv, Bulgaria ; Cooklev, T.

In the paper a new and interesting algorithm for computing the matrix polynomial is proposed. The comparison demonstrates that this is the most efficient algorithm among the existing algorithms. Furthermore we argue that the approach is optimal in the framework of the discussed algorithms. A new interesting number system is proposed in order to derive the approach

Published in:

Circuits and Systems, 1994. ISCAS '94., 1994 IEEE International Symposium on  (Volume:5 )

Date of Conference:

30 May-2 Jun 1994

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.