Bounds for the Zeros of Polynomials over Quaternion Division Algebra

Abstract

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 complex than the classical complex case. In this paper, we develop new bounds for the zeros of polynomials with quaternionic coefficients. We establish spectral norm inequalities for quaternionic matrices, particularly those of a partitioned form. These inequalities are applied to specialized quaternionic companion matrices to derive novel upper bounds for the zeros of the original polynomial. By establishing novel spectral norm inequalities for partitioned quaternionic matrices and utilizing the structural properties of companion matrices and their higher powers, we derive unexplored upper bounds for the zeros of quaternionic polynomials. Our bounds are systematically sharper than existing results and provide a unified framework for zero localization in the quaternionic setting.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…