An iterative algorithm for generalized Hamiltonian solution of a class of generalized coupled Sylvester-conjugate matrix equations

Tongxin Yan and Changfeng Ma

Applied Mathematics and Computation, 2021, vol. 411, issue C

Abstract: In this work, we present an iterative algorithm to solve a class of generalized coupled Sylvester-conjugate matrix equations over the generalized Hamiltonian matrices. We show that if the equations are consistent, a generalized Hamiltonian solution can be obtained within finite iteration steps in the absence of round-off errors for any initial generalized Hamiltonian matrix by the proposed iterative algorithm. Furthermore, we can obtain the minimum-norm generalized Hamiltonian solution by choosing the special initial matrices. Finally, numerical examples show that the iterative algorithm is effective.

Keywords: Generalized coupled Sylvester-conjugate matrix equations; Generalized Hamiltonian matrix; Iterative algorithm (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321005804
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:411:y:2021:i:c:s0096300321005804

DOI: 10.1016/j.amc.2021.126491

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().