An algorithm for the multiinput pole assignment problem (Q1322884)
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: An algorithm for the multiinput pole assignment problem |
scientific article; zbMATH DE number 566113
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the multiinput pole assignment problem |
scientific article; zbMATH DE number 566113 |
Statements
An algorithm for the multiinput pole assignment problem (English)
0 references
9 May 1994
0 references
Let \(A\) and \(B\) be real matrices of sizes \(n\times n\) and \(n\times m\), respectively. The authors present an algorithm for finding a matrix \(K\) such that the spectrum of the matrix \(A- BK\) is equal to a given conjugated complex number set \(\Omega= \{\mu_ 1,\mu_ 2,\dots,\mu_ n\}\). The algorithm assumes that the eigenvalues in question are pairwise distinct.
0 references
multiinput pole assignment problem
0 references
controllability
0 references
eigenvalue assignment
0 references
algorithm
0 references
eigenvalues
0 references
0 references
0.9569409
0 references
0.9472406
0 references
0.94394183
0 references
0.92789894
0 references
0.92205125
0 references
0.9165163
0 references