An Algorithm for Multiplication of Two Biquaternions

Authors

Aleksandr Cariow, Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, Zołnierska 49, 71- 210 Szczecin, PolandFollow
Galina Cariowa, Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, Zołnierska 49, 71- 210 Szczecin, PolandFollow
Anna Malewicz, Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, Zołnierska 49, 71- 210 Szczecin, PolandFollow

Author Country (or Countries)

Poland

Abstract

In this paper we introduce efficient algorithm for the multiplication of biquaternions. The direct multiplication of two biquaternions requires 64 real multiplications and 56 real additions. More effective solutions still do not exist.We show how to compute a product of the Pauli numbers with 24 real multiplications and 64 real additions. During synthesis of the discussed algorithm we use the fact that product of two biquaternions may be represented as vector-matrix product. The matrix that participates in the product calculating has unique structural properties that allow performing its advantageous decomposition. Namely this decomposition leads to significant reducing of the computational complexity of biquaternion multiplication.

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/100106

Recommended Citation

Cariow, Aleksandr; Cariowa, Galina; and Malewicz, Anna (2016) "An Algorithm for Multiplication of Two Biquaternions," Applied Mathematics & Information Sciences: Vol. 10: Iss. 1, Article 6.
DOI: http://dx.doi.org/10.18576/amis/100106
Available at: https://digitalcommons.aaru.edu.jo/amis/vol10/iss1/6