A new method for finding of row minimal degree solution to the matrix polynomial equation A(s) \(X(s)+B(s)\) \(Y(s)=C(s)\) (Q1086319)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new method for finding of row minimal degree solution to the matrix polynomial equation A(s) \(X(s)+B(s)\) \(Y(s)=C(s)\) |
scientific article; zbMATH DE number 3983389
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new method for finding of row minimal degree solution to the matrix polynomial equation A(s) \(X(s)+B(s)\) \(Y(s)=C(s)\) |
scientific article; zbMATH DE number 3983389 |
Statements
A new method for finding of row minimal degree solution to the matrix polynomial equation A(s) \(X(s)+B(s)\) \(Y(s)=C(s)\) (English)
0 references
1986
0 references
The paper deals with the polynomial matrix equation \(AX+BY=C\) and shows that if has always a unique row minimal degree solution X, Y for any C if and only if A and B are left coprime. A five step algorithm for finding this solution is formulated and an illustrative example is given.
0 references
polynomial matrix equation
0 references
row minimal degree solution
0 references
algorithm
0 references
0.8139806985855103
0 references
