Answers are grounded in this paper and cite their sources.
In this paper, we present an iterative algorithm to solve a generalized coupled Sylvester – conjugate matrix equations over Hamiltonian matrices. When the considered systems of matrix equations are consistent, it is proven that the solution can be obtained within finite iterative steps for any arbitrary initial generalized Hamiltonian matrices in the absence of round off errors. Two numerical examples are given to illustrate the effectiveness of the proposed method.
No takes yet. Share an insight, caveat, or question.
Ahmed M. E. Bayoumi (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: