Iterative algorithms for solving a class of complex conjugate and transpose matrix equations

This paper is concerned with iterative solutions to a class of complex matrix equations, which include some previously investigated matrix equations as special cases. By applying the hierarchical identification principle, an iterative algorithm is constructed to solve this class of matrix equations....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied mathematics and computation Ročník 217; číslo 21; s. 8343 - 8353
Hlavní autoři: Wu, Ai-Guo, Lv, Lingling, Duan, Guang-Ren
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier Inc 01.07.2011
Elsevier
Témata:
2-Norm
Algebra
Algorithms
Complex matrix equations
Conjugate
Conjugates
Convergence
Exact sciences and technology
Finite differences and functional equations
Iterative algorithm
Iterative algorithms
Linear and multilinear algebra, matrix theory
Mathematical analysis
Mathematical models
Mathematics
Matrices
Numerical analysis
Numerical analysis. Scientific computation
Real representation
Representations
Sciences and techniques of general use
Transpose
Complex matrix equations
Iterative algorithm
Real representation
Conjugate
Transpose
2-Norm
Iterative method
Algorithm
Convergence
Numerical analysis
Sufficient condition
Applied mathematics
Complex matrix
Matrix equation
Real matrix
ISSN:0096-3003, 1873-5649
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper is concerned with iterative solutions to a class of complex matrix equations, which include some previously investigated matrix equations as special cases. By applying the hierarchical identification principle, an iterative algorithm is constructed to solve this class of matrix equations. A sufficient condition is presented to guarantee that the proposed algorithm is convergent for an arbitrary initial matrix with a real representation of a complex matrix as tools. By using some properties of the real representation, a convergence condition that is easier to compute is also given in terms of original coefficient matrices. A numerical example is employed to illustrate the effectiveness of the proposed methods.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2011.02.113