DocumentCode
3054306
Title
On the computational complexity of bilinear forms evaluation over a body of quaternions
Author
Makarov, Oleg M.
Author_Institution
Academy of Sciences UK.SSR, Sevastopol, USSR
Volume
7
fYear
1982
fDate
30072
Firstpage
44
Lastpage
47
Abstract
In this article the problem of computing a set of bilinear forms is considered. Our goal is to find practical algorithms for a production of two 2 × 2 matrices over a real fields complex numbers, quaternions, evaluation of convolution which requires nearly twice as smaller productions as a known algorithms.
Keywords
Computational complexity; Ducts; Modules (abstract algebra); Quaternions;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '82.
Type
conf
DOI
10.1109/ICASSP.1982.1171626
Filename
1171626
Link To Document