## Abstract

A new Kantorovich type inequality for Hermite matrices is proposed in this paper. It holds for the invertible Hermite matrices and provides refinements of the classical results. Elementary methods suffice to prove the inequality.

Skip to main content
# A Note on Kantorovich Inequality for Hermite Matrices

## Abstract

## 1. Introduction

## 2. New Kantorovich Inequality for Hermite Matrices

## 3. Conclusion

## References

## Acknowledgments

## Author information

### Authors and Affiliations

### Corresponding author

## Rights and permissions

## About this article

### Cite this article

### Keywords

- Research Article
- Open Access
- Published:

*Journal of Inequalities and Applications*
**volume 2011**, Article number: 245767 (2011)

A new Kantorovich type inequality for Hermite matrices is proposed in this paper. It holds for the invertible Hermite matrices and provides refinements of the classical results. Elementary methods suffice to prove the inequality.

We first state the well-known Kantorovich inequality for a positive definite Hermite matrix (see [1, 2]), let be a positive definite Hermite matrix with real eigenvalues . Then

(11)

for any , , where denotes the conjugate transpose of the matrix . An equivalent form of this result is incorporated in

(12)

for any , .

This famous inequality plays an important role in statistics and numerical analysis, for example, in discussions of converging rates and error bounds of solving systems of equations (see [2–4]). Motivated by interests in applied mathematics outlined above, we establish in this paper a new Kantorovich type inequality, the classical Kantorovich inequality is modified to apply not only to positive definite but also to all invertible Hermitian matrices. An elementary proof of this result is also presented.

In the next section, we will state the main theorem and its proof. Before starting, we quickly review some basic definitions and notations. Let be an invertible Hermite matrix with real eigenvalues , and the corresponding orthonormal eigenvectors with , where denotes 2-norm of the vector of .

For , we define the following transform

(13)

If , then,

(14)

Otherwise, , then,

(15)

where

(16)

Theorem 2.1.

Let be an invertible Hermite matrix with real eigenvalues . Then

(21)

for any , , where , , , defined by (1.3), (1.4), (1.5), and (1.6).

To simplify the proof, we first introduce some lemmas.

Lemma 2.2.

With the assumptions in Theorem 2.1, then

(22)

for any , .

Lemma 2.3.

With the assumptions in Theorem 2.1, then

(23)

for any , .

Proof.

Let , then

(24)

while

(25)

The proof about is similar.

Lemma 2.4.

With the assumptions in Theorem 2.1, then

(26)

for any , .

Proof.

Thus,

(27)

The other inequality can be obtained similarly, the proof is completed.

We are now ready to prove the theorem.

Proof.

Thus,

(28)

while

(29)

By the Lemma 2.4, we have

(210)

Similarly, we can get that,

(211)

Therefore,

(212)

From for real numbers , we have

(213)

The proof of Theorem 2.1 is completed.

Remark 2.5.

Let be a positive definite Hermite matrix. From Theorem 2.1, we have

(214)

our result improves the Kantorovich inequality (1.2), so we conclude that Theorem 2.1 gives an improvement of the Kantorovich inequality that applies all invertible Hermite matrices.

Example 2.6.

Let

(215)

The eigenvalues of are: , , by easily calculating, we have

(216)

Therefore,

(217)

we get a sharpen upper bound.

In this paper, we introduce a new Kantorovich type inequality for the invertible Hermite matrices. In Theorem 2.1, if , , the result is well-known Kantorovich inequality. Moreover, it holds for negative definite Hermite matrices, even for any invertible Hermite matrix, there exists a similar inequality.

Horn RA, Johnson CR:

*Matrix Analysis*. Cambridge University Press, Cambridge, UK; 1985:xiii+561.Householder AS:

*The Theory of Matrices in Numerical Analysis*. Blaisdell, New York, NY, USA; 1964:xi+257.Wang S-G:

**A matrix version of the Wielandt inequality and its applications to statistics.***Linear Algebra and its Applications*1999,**296**(1–3):171–181.Nocedal J:

**Theory of algorithms for unconstrained optimization.***Acta Numerica*1992,**1:**199–242.

The authors would like to thank the two anonymous referees for their valuable comments which have been implemented in this revised version. This work is supported by Natural Science Foundation of Jiangxi, China No 2007GZS1760 and scienctific and technological project of Jiangxi education office, China No GJJ08432.

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Liu, Z., Wang, K. & Xu, C. A Note on Kantorovich Inequality for Hermite Matrices.
*J Inequal Appl* **2011**, 245767 (2011). https://doi.org/10.1155/2011/245767

Received:

Accepted:

Published:

DOI: https://doi.org/10.1155/2011/245767

- Real Number
- Applied Mathematic
- Classical Result
- Error Bound
- Equivalent Form