DocumentCode :
846705
Title :
An algorithm for solving the matrix polynomial equation B( s)D(s)+A(s)N(s )=H(s)
Author :
Lai, Yhean-Sen
Author_Institution :
AT&T Bell Lab., Holmdel, NJ, USA
Volume :
36
Issue :
8
fYear :
1989
fDate :
8/1/1989 12:00:00 AM
Firstpage :
1087
Lastpage :
1089
Abstract :
A simple method is presented for finding the solution [B( s)A(s)] of the matrix polynomial equation B(s)D(s)+A(s)N (s)=H(s), procedure, which involves solving a set of linear equations, and results in a unique solution for which the rows of [B(s)A(s)] have a minimal possible degree if the solution exists. An example is given to illustrate the procedure
Keywords :
matrix algebra; polynomials; linear equations; matrix polynomial equation; minimal possible degree; Circuits and systems; Control systems; Equations; Neural networks; Polynomials;
fLanguage :
English
Journal_Title :
Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-4094
Type :
jour
DOI :
10.1109/31.192417
Filename :
192417
Link To Document :
بازگشت