Name
Abstract | ||
|---|---|---|
In a previous paper [SIAM J. Matrix Anal. Appl., 10 (1989), pp. 446-456], Cox and Moss proved that the pole assignment algorithm of Petkov, Christov, and Konstantinov [IEEE Trans. Automat. Control, AC-29 (1984), pp. 1045-10481 is numerically stable for the real case. In this paper, a modified version of the algorithm of Petkov, Christov, and Konstantinov for the complex case is analyzed and the full algorithm (real and complex) is shown to be numerically stable. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1137/0613071 | SIAM Journal on Matrix Analysis and Applications |
Keywords | Field | DocType |
pole assignment algorithm,complex case,error analysis,numerical stability | Matrix (mathematics),Algorithm,Mathematics,Numerical stability | Journal |
Volume | Issue | ISSN |
13 | 4 | 0895-4798 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christopher L. Cox | 1 | 5 | 1.71 |
| William F. Moss | 2 | 3 | 1.24 |