Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bounds on the Minimum Eigenvalue Modulus for Hadamard Products of M\mathbf{M}- and H\mathbf{H}-Matrices and Their Inverses

Published 21 Sep 2026 in math.FA | (2609.24019v1)

Abstract: The quantity q(A∘A<sup>−1)q(A\circ A<sup>{-1}), the minimum modulus of the eigenvalues of A∘A<sup>−1A\circ A<sup>{-1}, arises naturally in connection with positive diagonal symmetrizability. For an invertible M\mathbf{M}-matrix AA of order nn, the classical bounds 2n≤q(A∘A<sup>−1)≤</sup>1\frac{2}{n}\leq q(A\circ A<sup>{-1})\leq</sup> 1 are known. We discuss the sharpness of the lower bound 2n\frac{2}{n} and investigate the converse of a related result involving the Jacobi iteration matrix. In particular, we show that ρ(JAk)→1ρ(J_{A_k})\to 1 does not, in general, imply q(Ak∘Ak<sup>−1)→</sup>2nq(A_k\circ A_k<sup>{-1})\to</sup> \frac{2}{n}, and identify a class for which this implication holds. We then turn to invertible H\mathbf{H}-matrices, a broader class that contains invertible M\mathbf{M}-matrices. We show that A∘A<sup>−1A\circ A<sup>{-1} is an invertible H\mathbf{H}-matrix whenever AA is an invertible H\mathbf{H}-matrix. In contrast to the M\mathbf{M}-matrix setting, q(A∘A<sup>−1)q(A\circ A<sup>{-1}) can be arbitrarily close to zero. However, replacing A<sup>−1A<sup>{-1} by the inverse of the comparison matrix restores the classical lower bound: we prove that q(A∘M(A)<sup>−1)≥</sup>2nq(A\circ\mathcal{M}(A)<sup>{-1})\geq</sup> \frac{2}{n} and obtain further bounds involving the Jacobi iteration matrix of M(A)\mathcal{M}(A). Finally, for positive diagonally symmetrizable invertible H\mathbf{H}-matrices, we establish the upper bound q(A∘A<sup>−1)≤1q(A\circ A<sup>{-1})\leq1 and, in the irreducible case, characterize when equality occurs.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.