Factorization and root-finding for polynomials over division quaternion algebras

05/03/2023
by   Przemysław Koprowski, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2018

Polynomial Factorization Is Simple and Helpful -- More So Than It Seems to Be

Univariate polynomial root-finding has been studied for four millennia, ...
research
04/11/2022

Root structures of polynomials with sparse exponents

For real polynomials with (sparse) exponents in some fixed set, Ψ(t...
research
04/06/2021

Constrained Parameterization of Reduced Rank and Co-integrated Vector Autoregression

The paper provides a parametrization of Vector Autoregression (VAR) that...
research
02/03/2016

Division and Slope Factorization of p-Adic Polynomials

We study two important operations on polynomials defined over complete d...
research
04/09/2020

The Weierstrass root finder is not generally convergent

Finding roots of univariate polynomials is one of the fundamental tasks ...
research
02/06/2022

Stable factorization for phase factors of quantum signal processing

This note proposes a new factorization algorithm for computing the phase...
research
08/01/2017

Digit Serial Methods with Applications to Division and Square Root (with mechanically checked correctness proofs)

We present a generic digit serial method (DSM) to compute the digits of ...

Please sign up or login with your details

Forgot password? Click here to reset