The Sz\'asz inequality for matrix polynomials and functional calculus
Piotr Pikul, Oskar Jakub Szyma\'nski, Micha{\l} Wojtylak

TL;DR
This paper extends the Szász inequality to matrix polynomials and matrix variables, providing sharper bounds than existing inequalities and relaxing zero location assumptions.
Contribution
It introduces a Szász-type inequality for matrix polynomials and matrix variables, improving scalar bounds and broadening applicability.
Findings
Derived a Szász inequality for matrix polynomials.
Showed the inequality can outperform von Neumann bounds.
Relaxed zero location assumptions in scalar Szász inequality.
Abstract
The Sz\'asz inequality is a classical result that provides a bound for polynomials with zeros in the upper half of the complex plane, expressed in terms of their low-order coefficients. Generalizations of this result to polynomials in several variables have been obtained by Borcea-Br\"and\'en and Knese. In this article, we discuss the Sz\'asz inequality in the context of polynomials with matrix coefficients or matrix variables. In the latter case, the estimation provided by the Sz\'asz-type inequality can be sharper than that offered by the von Neumann inequality. As a byproduct, we improve the scalar Sz\'asz inequality by relaxing the assumption regarding the location of zeros.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Inequalities and Applications · Matrix Theory and Algorithms · Mathematical functions and polynomials
