DocumentCode :
293211
Title :
Hybrid algorithm for the computation of the matrix polynomial using a fractal number system
Author :
Dimitrov, Vassil ; Cooklev, Todor
Author_Institution :
Dept. of Comput. Sci., Tech. Univ. of Plovdiv, Bulgaria
Volume :
5
fYear :
1994
fDate :
30 May-2 Jun 1994
Firstpage :
129
Abstract :
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
Keywords :
computational complexity; fractals; polynomial matrices; fractal number system; hybrid algorithm; matrix polynomial; Computer science; Fractals; Matrix decomposition; Paper technology; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1994. ISCAS '94., 1994 IEEE International Symposium on
Conference_Location :
London
Print_ISBN :
0-7803-1915-X
Type :
conf
DOI :
10.1109/ISCAS.1994.409320
Filename :
409320
Link To Document :
بازگشت