Abstract
The multiplicative complexity of a finite set of rational functions is the number of essential multiplications and divisions that are necessary and sufficient to compute these rational functions. We prove that the multiplicative complexity of inversion in the division algebra \H of Hamiltonian quaternions over the reals, that is, the multiplicative complexity of the coordinates of the inverse of a generic element from \H , is exactly eight. Furthermore, we show that the multiplicative complexity of the left and right division of Hamiltonian quaternions is at least eleven.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
July 17, 2001. Final version received: October 8, 2001.
Rights and permissions
About this article
Cite this article
Bläser, M., Kirrinnis, P. & Lauer, D. On the Multiplicative Complexity of the Inversion and Division of Hamiltonian Quaternions. Found. Comput. Math. 2, 191–199 (2002). https://doi.org/10.1007/s102080010021
Published:
Issue Date:
DOI: https://doi.org/10.1007/s102080010021