Iterative solutions to coupled Sylvester-conjugate matrix equations
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 54-66 |
| Journal / Publication | Computers and Mathematics with Applications |
| Volume | 60 |
| Issue number | 1 |
| Publication status | Published - Jul 2010 |
Link(s)
Abstract
This paper is concerned with iterative solutions to the coupled Sylvester-conjugate matrix equation with a unique solution. By applying a hierarchical identification principle, an iterative algorithm is established to solve this class of complex matrix equations. With a real representation of a complex matrix as a tool, a sufficient condition is given to guarantee that the iterative solutions given by the proposed algorithm converge to the exact solution for any initial matrices. In addition, a sufficient convergence condition that is easier to compute is also given by the original coefficient matrices. Finally, a numerical example is given to verify the effectiveness of the proposed algorithm. © 2010 Elsevier Ltd. All rights reserved.
Research Area(s)
- Convergence, Coupled Sylvester-conjugate matrix equation, Iterative algorithm, Real representation, Spectral norm
Citation Format(s)
Iterative solutions to coupled Sylvester-conjugate matrix equations. / Wu, Ai-Guo; Feng, Gang; Duan, Guang-Ren et al.
In: Computers and Mathematics with Applications, Vol. 60, No. 1, 07.2010, p. 54-66.
In: Computers and Mathematics with Applications, Vol. 60, No. 1, 07.2010, p. 54-66.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
