On the solution of large Sylvester-observer equations

Numerical Linear Algebra with Applications

Volumn 8, Issue 6-7, 2001, Pages 435-451

  Calvetti, D ^a   Lewis, B ^b   Reichel, L ^b  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

Arnoldi process; Control system; Luenberger observer; Partial fraction representation; Sylvester equation

Indexed keywords

EID: 0035628517     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/nla.254     Document Type: Article

References (20)

1. Datta BN. Numerical Methods for Linear Control Systems Design and Analysis. Academic Press, New York, to appear.
2. Kailath T. Linear Systems. Prentice-Hall, Englewood Cliffs, NJ, 1980.
3. Luenberger DG. Observers for multivariable systems. IEEE Transactions on Automatic Control 1966; AC-11:190-197.
4. Horn RA, Johnson CR. Topics in Matrix Analysis. Cambridge Univ. Press, Cambridge, 1991.
5. Datta BN, Saad Y. Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment. Linear Algebra and Its Applications 1991; 154-156:225-244.
6. Datta BN. Linear and numerical linear algebra in control theory: Some research problems. Linear Algebra and Its Applications 1994; 198:755-790.
7. Datta BN. Krylov subspace methods in control: an overview. Proceedings of the 36th IEEE Conference on Decision and Control, IEEE, Piscataway, 1997; 3844-3848.
8. Calvetti D, Reichel L. Application of ADI iterative methods to the restoration of noisy images. SIAM Journal on Matrix Analysis and Applications 1996; 17:165-186.
9. Hu DY, Reichel L. Krylov subspace methods for the Sylvester equation. Linear Algebra and Its Applications 1992; 172:283-313.
10. Bischof C, Datta BN, Purkyastha A. A parallel algorithm for the Sylvester-observer matrix equation. SIAM Journal on Scientific Computing 1996; 17:686-698.
11. Datta BN, Hetti C. Generalized Arnoldi methods for the Sylvester-observer equation and the multi-input pole placement problem. Proceedings of the 36th IEEE Conference on Decision and Control, IEEE, Piscataway, 1997; 4379-4383.
12. Hetti C. On numerical solutions of the Sylvester-observer equation, and the multi-input eigenvalue assignment problem. Ph.D. Thesis, Department of Mathematical Sciences, Northern Illinois University, Dekalb, IL, 1996.
13. Calvetti D, Reichel L. Numerical aspects of some solution methods for large Sylvester-observer equations. Proceedings of the 36th IEEE Conference on Decision and Control, IEEE, Piscataway, 1997; 4389-4393.
14. Datta BN. An algorithm to assign eigenvalues in a Hessenberg matrix. IEEE Transactions on Automatic Control 1987; AC-32:414-417.
15. Saad Y. Iterative Methods for Sparse Linear Systems. PWS, Boston, 1996.
16. Mehrmann V, Xu H. An analysis of the pole placement problem I. The single-input case. Electronic Transactions on Numerical Analysis 1996; 4:89-105.
17. Calvetti D, Lewis B, Reichel L. On the selection of poles in the single input pole placement problem. Linear Algebra and Its Applications 1999; 302-303:331-345.
18. Mehrmann V, Xu H. Choosing the poles so that the single-input pole placement problem is well conditioned. SIAM Journal on Matrix Analysis and Applications 1998; 19:664-681.
19. Calvetti D, Gallopoulos E, Reichel L. Incomplete partial fractions for parallel evaluation of rational matrix functions. Journal of Computational and Applied Mathematics 1995; 59:349-380.
20. Sorensen DC. Implicit application of polynomial filters in a k-step Arnoldi method. SIAM Journal on Matrix Analysis and Applications 1992; 13:357-385.