Iterative algorithms for coupled Sylvester-conjugate-transpose matrix equations by using hierarchical identification principle

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

Abstract

Iterative approaches to solve a class of coupled Sylvester-conjugate- transpose matrix equations with a unique solution are investigated. By applying hierarchical identification principle, an iterative algorithm is proposed to solve this class of complex matrix equations. By using the real representation of a complex matrix, a range of the convergence factor is given such that the proposed algorithm is convergent. By simplification, a sufficient condition guaranteeing the convergence of the proposed algorithm is also given in terms of the original coefficient matrices.

Original languageEnglish
Title of host publicationProceedings of the 32nd Chinese Control Conference, CCC 2013
PublisherIEEE
Pages241-246
Number of pages6
ISBN (Electronic)9789881563835
Publication statusPublished - 18 Oct 2013
Externally publishedYes
Event32nd Chinese Control Conference, CCC 2013 - Xi'an, China
Duration: 26 Jul 201328 Jul 2013

Publication series

NameChinese Control Conference, CCC
ISSN (Print)1934-1768
ISSN (Electronic)2161-2927

Conference

Conference32nd Chinese Control Conference, CCC 2013
Country/TerritoryChina
CityXi'an
Period26/07/1328/07/13

Keywords

  • 2-Norm
  • Coupled Sylvester-conjugate-transpose matrix equation
  • Iterative
  • Real representation

Fingerprint

Dive into the research topics of 'Iterative algorithms for coupled Sylvester-conjugate-transpose matrix equations by using hierarchical identification principle'. Together they form a unique fingerprint.

Cite this