Related papers: Zeros of Unilateral Quaternionic Polynomials
The quaternion equation X^n=A is solved for any integer number n > 1. A is a given quaternion with komplex numbers as its elements. We use the isomorphism between quaternions and (4,4)-matrices to solve this equation.
In this research paper, structured bi-matrix variate, matrix quadratic equations are considered. Some lemmas related to determining the eigenvalues of unknown matrices are proved. Also, a method of determining the diagonalizabe unknown…
A numerical algorithm (implemented in Matlab) for computing the zeros of the parabolic cylinder function $U(a,z)$ in domains of the complex plane is presented. The algorithm uses accurate approximations to the first zero plus a highly…
This paper discusses the location of zeros of polynomials in a polynomial sequence $\{P_n(z)\}$ generated by a three-term recurrence relation of the form $P_n(z)+ B(z)P_{n-1}(z) +A(z) P_{n-k}(z)=0$ with $k>2$ and the standard initial…
In this article we show and implement a simple and effcient method to strictly locate eigenvectors and eigenvalues of a given matrix, based on the modified cone condition. As a consequence we can also effectively localize zeros of complex…
This paper presents new formulary solutions for quantic polynomial equations in general forms, where we present five solutions for any fifth degree polynomial equation with real coefficients, and thereby having the possibility to calculate…
The purpose of the present paper is to examine the zeros of $R$-Bonacci polynomials and their derivatives. We confirm a conjecture about the zeros of $R$-Bonacci polynomials for some special cases. We also find explicit formulas of the…
Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…
The goal of this paper is to study the path-following method for univariate polynomials. We propose to study the complexity and condition properties when the Newton method is applied as a correction operator. Then we study the geodesics and…
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…
We present a zero decomposition theorem and an algorithm based on Wu's method, which computes a zero decomposition with multiplicity for a given zero-dimensional polynomial system. If the system satisfies some condition, the zero…
We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…
Algebraic and analytic aspects of self-adjoint operators of order four or more with polynomial coefficients are investigated. As a consequence, a systematic way of constructing such operators is given. The procedure is applied to obtain…
Polynomials whose zeros are symmetric either to the real line or to the unit circle are very important in mathematics and physics. We can classify them into three main classes: the self-conjugate polynomials, whose zeros are symmetric to…
The decomposition of the polynomials on the quaternionic unit sphere in $\Hd$ into irreducible modules under the action of the quaternionic unitary (symplectic) group and quaternionic scalar multiplication has been studied by several…
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…
This manuscript presents a novel and reliable third-order iterative procedure for computing the zeros of solutions to second-order ordinary differential equations. By approximating the solution of the related Riccati differential equation…
In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for…
Over the split-octonion algebra defined over an arbitrary field, we solve all polynomial equations whose coefficients are scalar except for the constant term. As an application, we determine the square and cubic roots of an octonion.
We utilize Cauchy's argument principle in combination with the Jacobian of a holomorphic function in several complex variables and the first moment of a ratio of two correlated complex normal random variables to prove explicit formulas for…