On the Low-Degree Solution of the Sylvester Matrix Polynomial Equation
We study the low-degree solution of the Sylvester matrix equation A1λ+A0Xλ+YλB1λ+B0=C0, where A1λ+A0 and B1λ+B0 are regular. Using the substitution of parameter variables λ, we assume that the matrices A0 and B0 are invertible. Thus, we prove that if the equation is solvable, then it has a low-degre...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/4612177 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|