Papers › Bounding the zeros of polynomials using the Frobenius companion matrix partitioned by...
Bounding the zeros of polynomials using the Frobenius companion matrix partitioned by the Cartesian decomposition
Mohammad W. Alomari
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections