Abstract

We consider algorithmic aspects of improving calculations of octonion product. Octonions together with quaternions represent a variety of hypercomplex numbers. An advantage of the suggested algorithm consists in decreased twice number of calculated real number products needed to compute the octonion product if compared to a straightforward naive way of performing the calculation. During synthesis of the discussed algorithm we use a fact that octonions product may be represented by a vector-matrix product. Such representation provides a possibility to discover repeating elements in the matrix structure and to use specific properties of their mutual placement to decrease the number of real number products needed to compute the octonion product.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.