Related papers: Zeros of Unilateral Quaternionic Polynomials
For polynomials of degree two which have no zeros, the method of accompanying variables is developed and zeros of associated vector polynomials are determined. Our flexible method uses a wide variety of possible vector-valued vector…
Recently, three numerical methods for the computation of eigenvalues of singular matrix pencils, based on a rank-completing perturbation, a rank-projection, or an augmentation were developed. We show that all three approaches can be…
A quantum mechanical search procedure to determine the real zeros of a polynomial is introduced. It is based on the construction of a spin observable whose eigenvalues coincide with the zeros of the polynomial. Subsequent quantum mechanical…
We obtain several Cauchy-like and Pellet-like results for the zeros of a general complex polynomial by considering similarity transformations of the squared companion matrix and the reformulation of the zeros of a scalar polynomial as the…
We propose an algorithm for finding zero divisors in quaternion algebras over quadratic number fields, or equivalently, solving homogeneous quadratic equations in three variables over $\mathbb{Q}(\sqrt{d})$ where $d$ is a square-free…
We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…
In this work, Some new inequalities for the numerical radius of block $n$-by-$n$ matrices are presented. As an application, bounding of zeros of polynomials using the Frobenius companion matrix partitioned by the Cartesian decomposition…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
In this paper we present a complete method for finding the roots of all polynomials of the form $\phi(z)=c_n z^n+c_{n-1} z^{n-1}+\dots+c_1 z+c_0$ over a given octonion division algebra. When $\phi(z)$ is monic we also consider the companion…
Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…
A new numerical method is introduced for calculation of quasi-polynomial zeros with constant single delay. The trajectories of zeros are obtained depending on time-delay from zero to final time-delay value. The method determines all the…
In this paper, we shall present an interesting and significant refinement of a classical result of Cauchy about the moduli of the zeros of a quaternionic polynomial. As an application of this result we shall obtain zero-free regions of…
We study the number of real zeros of trigonometric polynomials in a period and the number of zeros of self-reciprocal algebraic polynomials on the unit circle under the assumption that their coefficients are in a fixed finite set of real…
We present new polynomial-based methods for discrete-time quaternionic systems, highlighting how noncommutative multiplication modifies classical control approaches. Defining quaternionic polynomials via a backward-shift operator, we…
We propose polynomial-time algorithms for finding nontrivial zeros of quadratic forms with four variables over rational function fields of characteristic 2. We apply these results to find prescribed quadratic subfields of quaternion…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
In this paper some algorithms will be presented which can be used for the calculation of zeros of polynomials and eigenvalues of polynomial matrices with a multiplicity larger than one. The numerical values calculated with MATLAB are used…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd…
This paper formulates an elementary algorithm for resolution of singularities in a neighborhood of a singular point over a field of characteristic zero. The algorithm is composed of finite sequences of Newton polyhedra and monomial…