An algorithm for multipication of Kaluza numbers

May 24, 2015 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Aleksandr Cariow, Galina Cariowa, RafaΕ‚ Łentek arXiv ID 1505.06425 Category cs.DS: Data Structures & Algorithms Citations 1 Venue arXiv.org Last Checked 4 months ago
Abstract
This paper presents the derivation of a new algorithm for multiplying of two Kaluza numbers. Performing this operation directly requires 1024 real multiplications and 992 real additions. The proposed algorithm can compute the same result with only 512 real multiplications and 576 real additions. The derivation of our algorithm is based on utilizing the fact that multiplication of two Kaluza numbers can be expressed as a matrixvector product. The matrix multiplicand that participates in the product calculating has unique structural properties. Namely exploitation of these specific properties leads to significant reducing of the complexity of Kaluza numbers multiplication.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted