Journal Title
Title of Journal: Found Comput Math
|
Abbravation: Foundations of Computational Mathematics
|
Publisher
Springer-Verlag
|
|
|
|
|
|
Authors: Markus Bläser Peter Kirrinnis Daniel Lauer
Publish Date: 2014/11/25
Volume: 2, Issue: 2, Pages: 191-199
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
Keywords:
.
|
Other Papers In This Journal:
|