Bounding the zeros of polynomials using the Frobenius companion matrix partitioned by the Cartesian decomposition

2021/03/13 by Mohammad W. Alomari, Alomari, Mohammad W.
Computer Science · Engineering · Mathematics · #Advanced Optimization Algorithms Research #Matrix Theory and Algorithms #graph theory and CDMA systems #math.CA #math.FA #msc:15A45 #msc:47A12

paper · pdf · doi:10.48550/arxiv.2103.07652

15 pages

arxiv created 2021/09/11 · arxiv updated 2021/10/04

Abstract

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 approach is proved and affirmed by a numerical example showing that our approach of bounding zeros of polynomials could be very effective in comparison with the most famous and some recent results presented in the field.

Related

• Estimations of zeros of a polynomial using numerical radius inequalities
• New lower bound for numerical radius for off-diagonal 2× 2 matrices
• Bounds for the Zeros of Quaternionic Polynomials and Regular Functions Using Matrix Techniques
• On the Frobenius norm of the inverse of a non-negative matrix
• Zeros of orthogonal polynomials and some matrix inequalities