Um Algoritmo Rápido para a Multiplicação de Quatérnios

This work proposes a fast algorithm for computing a product of two quaternions. The direct computation of this product requires 16 multiplications and 12 additions. The algorithm proposed here uses 8 multiplications and 28 additions, thus reducing the multiplicative complexity for computing the quaternion product.