Abstract
Needs to be found, is a classical equation. There has been much study, both from theoretical and computational view points, on this equation. The results of existence and uniqueness are well-known and numerically effective algorithms have been developed in recent years (see, Datta [2]), to compute the solution.
Dedicated to Biswa Datta for his contribution to numerical aspects of control theory, in particular to Sylvester-observer equation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bhattacharyya SP, de Souza E (1982) Pole assignment via Sylvester’s equation. Syst Control Lett 1:261–283
Datta BN (2003) Numerical methods for linear control systems. Elsevier Academic Press
Luenberger D (1964) Observing the state of a linear system. IEEE Trans Mil Electron 8:74–80
Van Dooren P (1984) Reduced order observers: a new algorithm and proof. Syst Cont Lett 4:243–251
Carvalho J, Datta BN (2001) A new block algorithm for the Sylvester-observer equation arising in state-estimation. In: Proceedings of the IEEE International Conference on Decision and Control, Orlando, pp 3398–3403
Carvalho J, Datta K, Hong YP (2003) A new block algorithm for full-rank solution of the Sylvester observer equation. IEEE Trans Autom Control, 48(12):2223–2228
Datta BN, Sarkissian D (2000) Block algorithms for state estimation and functional observers. In: Proceedings of the IEEE International Symposium on Computer-Aided Control System Design, Anchorage, pp 19–23
Datta BN, Saad Y (1991) Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment. Lin Alg Appl 154–156:225–244
Calvetti D, Lewis B, Reichel L (2001) On the solution of large Sylvester-observer equation. Num Lin Alg Appl 8:435–452
Bischof C, Datta BN, Purkayastha A (1996) A parallel algorithm for the Sylvester observer equation. SIAM J Sci Comp 17:686–698
de Souza E, Bhattacharyya SP (1981) Controllability, observability and the solution of AX − XB = C. Lin Alg Appl 39:167–188
Datta K, Hong YP, Lee R (1997) Applications of linear transformations of matrix equations. Lin Alg Appl 267:221–240
Golub G, Nash S, Van Loan C (1979) A Hessenberg–Schur method for the problem AX + XB = C. IEEE Trans Autom Control AC-24:909–913
Higham NJ (1995) The test matrix toolbox for Matlab. Numerical Analysis Report No. 276. Manchester Centre for Computational Mathematics, University of Manchester, UK
Datta K (1988) The matrix equation \(AX - XB = R\) and its applications. Lin Alg. Appl 109:91–105
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Datta, K., Thapa, M. (2011). Unique Full-Rank Solution of the Sylvester-Observer Equation and Its Application to State Estimation in Control Design. In: Van Dooren, P., Bhattacharyya, S., Chan, R., Olshevsky, V., Routray, A. (eds) Numerical Linear Algebra in Signals, Systems and Control. Lecture Notes in Electrical Engineering, vol 80. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-0602-6_10
Download citation
DOI: https://doi.org/10.1007/978-94-007-0602-6_10
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-0601-9
Online ISBN: 978-94-007-0602-6
eBook Packages: EngineeringEngineering (R0)