Factorization and root-finding for polynomials over division quaternion algebras

From MaRDI portal
Publication:6081963

DOI10.1145/3597066.3597096zbMATH Open1527.11096arXiv2305.02072OpenAlexW4383213619WikidataQ131124587 ScholiaQ131124587MaRDI QIDQ6081963FDOQ6081963


Authors: Przemysław Koprowski Edit this on Wikidata


Publication date: 3 November 2023

Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Abstract: Polynomial factorization and root finding are among the most standard themes of computational mathematics. Yet still, little has been done for polynomials over quaternion algebras, with the single exception of Hamiltonian quaternions for which there are known numerical methods for polynomial root approximation. The sole purpose of the present paper is to present a polynomial factorization algorithm for division quaternion algebras over number fields, together with its adaptation for root finding.


Full work available at URL: https://arxiv.org/abs/2305.02072




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Factorization and root-finding for polynomials over division quaternion algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6081963)