相关论文: Zeros of Unilateral Quaternionic Polynomials

A fast implicit QR algorithm for eigenvalue computation of low rank corrections of unitary matrices is adjusted to work with matrix pencils arising from polynomial zerofinding problems . The modified QZ algorithm computes the generalized…

A. Horn's problem concerns find two self adjoint matrices A, B, so that A, B, and A+B have prescribed spectrum. In this paper, we show how it connects to an interpolation problem for two variable real zero polynomials and a tracial moment…

The eigenvalue problem for 3x3 octonionic Hermitian matrices contains some surprises, which we have reported elsewhere. In particular, the eigenvalues need not be real, there are 6 rather than 3 real eigenvalues, and the corresponding…

The independence polynomial originates in statistical physics as the partition function of the hard-core model. The location of the complex zeros of the polynomial is related to phase transitions, and plays an important role in the design…

Finding an approximate region containing all the zeros of analytic polynomials is a well-studied problem. But the numb er of the zeros and regions containing all the zeros of complex-valued harmonic polynomials is relatively a fresh…

Several recently discovered properties of multiple families of special polynomials (some orthogonal and some not) that satisfy certain differential, difference or q-difference equations are reviewed. A general method of construction of…

Let $f$ and $F$ be two polynomials satisfying $F(x)=u(x)f(x)+v(x)f'(x)$. We characterize the relation between the location and multiplicity of the real zeros of $f$ and $F$, which generalizes and unifies many known results, including the…

First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…

In this note we investigate, as a natural continuation of [K. Castillo, Constr. Approx., 55 (2022) 605-627], the behaviour of the zeros of discrete paraorthogonal polynomials on the unit circle with respect to a real parameter.

In this paper, we present a generic parametrization of generically zero-dimensional parametric polynomial systems. More specifically, we study the specialization properties of the Rational Univariate Representation and derive bounds on the…

Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases. The objective of this study is to develop a quantum…

Algorithms for the computation of the real zeros of hypergeometric functions which are solutions of second order ODEs are described. The algorithms are based on global fixed point iterations which apply to families of functions satisfying…

We discuss the (right) eigenvalue equation for $\mathbb{H}$, $\mathbb{C}$ and $\mathbb{R}$ linear quaternionic operators. The possibility to introduce an isomorphism between these operators and real/complex matrices allows to translate the…

In this paper we consider monic polynomials such that their coefficients coincide with their zeros. These polynomials were first introduced by S. Ulam. We combine methods of algebraic geometry and dynamical systems to prove several results.…

Let $\mathbb{Z}_p[x]$ be the set of all functions whose coefficients are in the field of $p$-adic integers $\mathbb{Z}_p$. This work considers a problem of finding a root of a polynomial equation $P(x)=0$ where $P(x)\in\mathbb{Z}_p[x]$. The…

In this paper we present a new method of solving certain quartic and higher degree homogeneous polynomial diophantine equations in four variables. The method can also be extended to solve simultaneous homogeneous polynomial diophantine…

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

We identify a class of remarkable algebraic relations satisfied by the zeros of the Krall orthogonal polynomials that are eigenfunctions of linear differential operators of order higher than two. Given an orthogonal polynomial family…

A new one-parameter family of iterative method for solving nonlinear equations is constructed and studied. Two variants, both with cubic convergence, are developed, one for finding simple zeros and other for multiple zeros of known…