Related papers: Computing square roots in quaternion algebras
We obtain several structure results for a class of spherical subgroups of connected reductive complex algebraic groups that extends the class of strongly solvable spherical subgroups. Based on these results, we construct certain…
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.
We present a practical Newton-based method for computing left eigenvalues of quaternion matrices. It uses only standard real/complex linear-algebra kernels via embeddings and applies to matrices of any size. Extensive tests on literature…
In this paper, we propose a new algebraic winding number and prove that it computes the number of complex roots of a polynomial in a rectangle, including roots on edges or vertices with appropriate counting. The definition makes sense for…
We explain the orthogonal planes split (OPS) of quaternions based on the arbitrary choice of one or two linearly independent pure unit quaternions $f,g$. Next we systematically generalize the quaternionic Fourier transform (QFT) applied to…
The power of Clifford or, geometric, algebra lies in its ability to represent geometric operations in a concise and elegant manner. Clifford algebras provide the natural generalizations of complex, dual numbers and quaternions into…
We provide an analogue of Wedderburn's factorization method for central polynomials with coefficients in an octonion division algebra, and present an algorithm for fully factoring polynomials of degree $n$ with $n$ conjugacy classes of…
We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…
We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this problem. In particular, the well-known algorithm for…
Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great…
This article provides a simple trigonometric method for determining how many roots of a quartic equation are real and how many are complex, without solving the equation. The approach replaces the quartic's classical discriminant -- a…
A variety of universal similarity factorization equalities over real Clifford algebras ${\cal R}_{p,q}$ are established. On the basis of these equalities, real, complex and quaternion matrix representations of elements in ${\cal R}_{p,q}$…
Solving quadratic equations over finite fields is a fundamental task in algebraic coding theory and serves as a key subroutine for computing the roots of cubic and quartic polynomials. Notably, any quadratic polynomial over binary extension…
We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…
The u-invariant of a field is the supremum of the dimensions of anisotropic quadratic forms over the field. We define corresponding u-invariants for hermitian and generalised quadratic forms over a division algebra with involution in…
This paper addresses the numerical solution of the matrix square root problem. Two fixed point iterations are proposed by rearranging the nonlinear matrix equation $A - X^2 = 0$ and incorporating a positive scaling parameter. The proposals…
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…
In this article we use a method of finding the index of a complex-valued function by determined number of arithmetic operations to describe an algorithm of localization of roots of square-free polynomials. We give an estimation of the…
We consider the class of algebras of rank 4 equipped with a standard involution over an arbitrary base ring. In particular, we characterize quaternion rings, those algebras defined by the construction of the even Clifford algebra.
In this paper, we provide a new method to find all zeros of polynomials with quaternionic coefficients located on only one side of the powers of the variable (these polynomials are called simple polynomials). This method is much more…