相关论文: Bounding the zeros of polynomials using the Froben…

We present new bounds for the numerical radius of bounded linear operators and $2\times 2$ operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new…

Locating the zeros of quaternionic polynomials is a fundamental problem with significant implications across scientific and engineering disciplines, yet the noncommutative nature of quaternion multiplication makes it fundamentally more…

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…

We investigate the problem of determining the zeros of quaternionic polynomials using matrix method. In a recent paper, Dar et al. \cite{RD} proved that the zeros of a quaternionic polynomial and the left eigenvalues of the corresponding…

We obtain bounds for the numerical radius of $2 \times 2$ operator matrices which improve on the existing bounds. We also show that the inequalities obtained here generalize the existing ones. As an application of the results obtained here…

The purpose of this paper is to show how the problem of finding the zeros of unilateral n-order quaternionic polynomials can be solved by determining the eigen-vectors of the corresponding companion matrix. This approach, probably…

In this paper, we are concerned with the problem of locating the zeros of polynomials of a quaternionic variable with quaternionic coefficients. We derive some new Cauchy bounds for the zeros of a polynomial by virtue of maximum modulus…

An approach is proposed for bounding the number of zeros that solutions of linear differential systems with polynomial coefficients may have. A bound is obtained in a special case which improves upon currently existing.

In this paper, we derive new bounds for the zeros of quaternionic polynomials by applying localization theorems, which includes Gershgorin-type theorems for the left eigenvalues of matrices of left monic quaternionic polynomials. These…

Classically, the Bezout matrix or simply Bezoutian of two polynomials is used to locate the roots of the polynomial and, in particular, test for stability. In this paper, we develop the theory of Bezoutians on real Riemann surfaces of…

It is known that polynomials over quaternions may have spherical zeros and isolated left and right zeros. These zeros along with appropriately defined multiplicities form the zero structure of a polynomial. In this paper, we equivalently…

Frobenius companion matrices arise when we write an $n$-th order linear ordinary differential equation as a system of first order differential equations. These matrices and their transpose have very nice properties. By using the powers of…

A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…

The main aim of this work is to apply the matrix approach of ortho\-gonal polynomials associated with infinite Hermitian definite positive matrices in relation with an important question regarding the location of zeros of Sobolev orthogonal…

We present an alternative method for computing primary decomposition of zero-dimensional ideals over finite fields. Based upon the further decomposition of the invariant subspace of the Frobenius map acting on the quotient algebra in the…

Using a variety of matrix techniques, the problem of locating the left eigenvalues of the quaternion companion matrices are investigated in this paper. In a recent paper, Dar et al. [6], proved that the zeros of a quaternionic polynomial…

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…

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

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…

The article is devoted to the investigation of transformation groups of polynomials over Cayley-Dickson algebras and their manifolds of zeros. The problems about expressibility of zeros with the help of roots and decomposibility of…