Algorithms for Solving Nonhomogeneous Generalized Sylvester Matrix Equations

Ehab A. El-Sayed and Eid E. El Behady

Mathematical Problems in Engineering, 2020, vol. 2020, 1-5

Abstract:

This paper considers a new method to solve the first-order and second-order nonhomogeneous generalized Sylvester matrix equations and , respectively, where , and are the arbitrary real known matrices and and are the matrices to be determined. An explicit solution for these equations is proposed, based on the orthogonal reduction of the matrix to an upper Hessenberg form . The technique is very simple and does not require the eigenvalues of matrix to be known. The proposed method is illustrated by numerical examples.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/1549520.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/1549520.xml (text/xml)

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:hin:jnlmpe:1549520

DOI: 10.1155/2020/1549520

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().