Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2015, Article ID 521214, 5 pages
http://dx.doi.org/10.1155/2015/521214
Research Article

Equalities and Inequalities for Norms of Block Imaginary Circulant Operator Matrices

Department of Information and Telecommunications Engineering, The University of Suwon, Wau-ri, Bongdam-eup, Hwaseong-si, Gyeonggi-do 445-743, Republic of Korea

Received 25 July 2014; Accepted 14 September 2014

Academic Editor: Zidong Wang

Copyright © 2015 Xiaoyu Jiang and Kicheon Hong. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Circulant, block circulant-type matrices and operator norms have become effective tools in solving networked systems. In this paper, the block imaginary circulant operator matrices are discussed. By utilizing the special structure of such matrices, several norm equalities and inequalities are presented. The norm in consideration is the weakly unitarily invariant norm, which satisfies . The usual operator norm and Schatten -norm are included. Furthermore, some special cases and examples are given.

1. Introduction

Circulant-type matrices have significant applications in network systems. For example, Noual et al. [1] presented some results on the dynamical behaviours of some specific nonmonotone Boolean automata networks called XOR circulant networks. In [2], the authors proposed a special class of the feedback delay networks using circulant matrices. Based on the circulant adjacency matrices of the networks induced by these interior symmetries, Aguiar and Ruan [3] analyzed the impact of interior symmetries on the multiplicity of the eigenvalues of the Jacobian matrix at a fully synchronous equilibrium for the coupled cell systems associated with homogeneous networks. Jing and Jafarkhani [4] proposed distributed differential space-time codes that work for networks with any number of relays using circulant matrices. In [5], the authors showed a structure for the decoupling of circulant symmetric arrays of more than four elements.

The well-known circulant, block circulant-type matrices and operator norms have set up the strong basis with the work in [619].

In this paper, let denote the imaginary circulant algebra of all bounded linear operators on a complex separable Hilbert space . The direct sum of copies of is denoted by . If , , are operators in , then the operator matrix (or the partitioned operator) can be considered as an operator in , which is defined by for every vector .

Recall that a norm on is called weakly unitarily invariant if for all and for all unitary operators .

The Schatten -norms , , are important examples of unitarily invariant norms, which are defined on the Schatten -classes.

If are operators in , we write the direct sum for the block-diagonal operator matrix , regarded as an operator on . Thus, and for . In particular, for .

The pinching inequality asserts that if , then For the operator norm and the Schatten -norms, the inequality 1 states that for . It is known [18] that for , equality in 3 holds if and only if is block-diagonal, that is, if and only if , for .

2. Equalities for the Norm of Imaginary Circulant Operator Matrices

In this section, we present block imaginary circulant operator matrix. By combining the special properties of block imaginary circulant operator matrix with unitarily invariant norm, we prove an equality in the following theorem.

If are imaginary circulant operators in , the block imaginary circulant operator matrix is the matrix whose first row has entries and the other rows are obtained by successive cyclic permutations of these entries; that is, where .

It is known that , where Thus, every imaginary circulant operator matrix is unitarily equivalent to a circulant operator matrix.

Theorem 1. Let be any operators in . Then, for every weakly unitarily invariant norm, one has where , , and .

Proof. The roots of are .
Now, let , where Then it is easy to prove that is a unitary operator in and By the invariance property of weakly unitarily invariant norms, we obtain

Synthesizing the norm equality in Theorem 1 to the usual operator norm and to the Schatten -norms, we obtain the corollary and remark as follows.

Corollary 2. Let be any operators in . Then one has for .
In particular, let ; one has for .

Remark 3. Here we give some special cases of Corollary 2.
(i) If , then for .
(ii) If , then for .

3. Pinching-Type Inequalities for Imaginary Circulant Operator Matrices

In this section, for imaginary circulant operator matrices, we obtain pinching-type inequalities by the triangle inequality and the invariance property of unitarily invariant norms.

Theorem 4. Let be an operator matrices in . Then, for every weakly unitarily invariant norm, one has where

Proof. Let be the operator with We can prove easily that is a unitary operator for all and where Now let Then, from Theorem 1, we have Thus, by the invariance property of unitarily invariant norms and the triangle inequality, we get

Substituting the norm inequality 14 to the usual operator norm and to the Schatten -norms, we obtain the following corollary.

Corollary 5. Let be an operator matrix in . Then for , where is given in 15.

As a special case when , Corollary 5 asserts that for .

It should be mentioned here that the norm inequalities in Theorems 1 and 4 are sharp. This is demonstrated in the following proposition.

Proposition 6. Let be some operators in . If , then the inequality in Theorem 4 becomes an equality.

Proof. Let . Then it follows from Theorem 1 that Since , , and , it follows that where

By Proposition 6, it is easy to see that equality holds in the inequality 14 if and only if is imaginary circulant for . Furthermore, we obtain the following proposition by using the general Clarkson inequalities which can be seen in Proposition 1 of [19].

Proposition 7. Let be an operator matrix in , and let . Then if and only if is imaginary circulant.

Proof. In view of Proposition 1, it if sufficient to prove the “only if” part. Let be as in the proof of Theorem 1. If , then it follows from the proof of Theorem 1 that Now invoking Clarkson inequalities for several operators, it follows that Consequently, is imaginary circulant matrix.

4. Conclusion

By utilizing the special structure of imaginary circulant matrices, we obtain several norm equalities and inequalities, where the norm under consideration is the weakly unitarily invariant norm. Based on the existing problems in [2023], we will exploit solving these problems by circulant matrices technique.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgment

This work was supported by the GRRC Program of Gyeonggi Province ((GRRC SUWON 2014-B3), Development of cloud computing-based intelligent video security surveillance system with active tracking technology). Its support is gratefully acknowledged.

References

  1. M. Noual, D. Regnault, and S. Sene, “About non-monotony in Boolean automata networks,” Theoretical Computer Science, vol. 504, pp. 12–25, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. D. Rocchesso and J. O. Smith, “Circulant and elliptic feedback delay networks for artificial reverberation,” IEEE Transactions on Speech and Audio Processing, vol. 5, no. 1, pp. 51–63, 1997. View at Publisher · View at Google Scholar · View at Scopus
  3. M. A. Aguiar and H. Ruan, “Interior symmetries and multiple eigenvalues for homogeneous networks,” SIAM Journal on Applied Dynamical Systems, vol. 11, no. 4, pp. 1231–1269, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  4. Y. Jing and H. Jafarkhani, “Distributed differential space-time coding for wireless relay networks,” IEEE Transactions on Communications, vol. 56, no. 7, pp. 1092–1100, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. J. C. Coetzee, J. D. Cordwell, E. Underwood, and S. L. Waite, “Single-layer decoupling networks for circulant symmetric arrays,” IETE Technical Review, vol. 28, no. 3, pp. 232–239, 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. P. J. Davis, Circulant Matrices, Chelsea, New York, NY, USA, 1994.
  7. Z. L. Jiang and Z. X. Zhou, Circulant Matrices, Chengdu Technology University Publishing Company, Chengdu, China, 1999.
  8. Z. Jiang, “On the minimal polynomials and the inverses of multilevel scaled factor circulant matrices,” Abstract and Applied Analysis, vol. 2014, Article ID 521643, 10 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  9. Z. Jiang, T. Xu, and F. Lu, “Isomorphic operators and functional equations for the skew-circulant algebra,” Abstract and Applied Analysis, vol. 2014, Article ID 418194, 8 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. X. Y. Jiang and K. Hong, “Exact determinants of some special circulant matrices involving four kinds of famous numbers,” Abstract and Applied Analysis, vol. 2014, Article ID 273680, 12 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  11. K. M. Audenaert, “A norm compression inequality for block partitioned positive semidefinite matrices,” Linear Algebra and Its Applications, vol. 413, no. 1, pp. 155–176, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. R. Bhatia and F. Kittaneh, “Clarkson inequalities with several operators,” The Bulletin of the London Mathematical Society, vol. 36, no. 6, pp. 820–832, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. C. King, “Inequalities for trace norms of 2×2 block matrices,” Communications in Mathematical Physics, vol. 242, no. 3, pp. 531–545, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. C. King and M. Nathanson, “New trace norm inequalities for 2×2 blocks of diagonal matrices,” Linear Algebra and Its Applications, vol. 389, pp. 77–93, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. E. Kissin, “On Clarkson-McCARthy inequalities for n-tuples of operators,” Proceedings of the American Mathematical Society, vol. 135, no. 8, pp. 2483–2495, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. D. Bertaccini and M. K. Ng, “Block ω-circulant preconditioners for the systems of differential equations,” CALCOLO, vol. 40, no. 2, pp. 71–90, 2003. View at Publisher · View at Google Scholar
  17. I. S. Hwang, D.-O. Kang, and W. Y. Lee, “Hyponormal Toeplitz operators with matrix-valued circulant symbols,” Complex Analysis and Operator Theory, vol. 7, no. 4, pp. 843–861, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  18. I. C. Gohberg and M. G. Kreĭn, Introduction to the Theory of Linear Nonselfadjoint Operators, vol. 18, American Mathematical Society, Providence, RI, USA, 1969. View at MathSciNet
  19. W. Bani-Domi and F. Kittaneh, “Norm equalities and inequalities for operator matrices,” Linear Algebra and Its Applications, vol. 429, no. 1, pp. 57–67, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. H. Dong, Z. Wang, and H. Gao, “Distributed H∞ filtering for a class of markovian jump nonlinear time-delay systems over lossy sensor networks,” IEEE Transactions on Industrial Electronics, vol. 60, no. 10, pp. 4665–4672, 2013. View at Publisher · View at Google Scholar · View at Scopus
  21. Z. Wang, H. Dong, B. Shen, and H. Gao, “Finite-horizon H filtering with missing measurements and quantization effects,” IEEE Transactions on Automatic Control, vol. 58, no. 7, pp. 1707–1718, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. D. Ding, Z. Wang, J. Hu, and H. Shu, “Dissipative control for state-saturated discrete time-varying systems with randomly occurring nonlinearities and missing measurements,” International Journal of Control, vol. 86, no. 4, pp. 674–688, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  23. J. Hu, Z. Wang, B. Shen, and H. Gao, “Quantised recursive filtering for a class of nonlinear systems with multiplicative noises and missing measurements,” International Journal of Control, vol. 86, no. 4, pp. 650–663, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus