A method for computing quadratic Brunovsky forms

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

In this paper, for continuous, linearly-controllable quadratic control systems with a single input, an explicit, constructive method is proposed for studying their Brunovsky forms, initially studied in [W. Kang and A. J. Kroner, Extended quadratic controller normal form and dynamic state feedback linearization of nonlinear systems, SIAM Journal on Control and Optimization, 30:1319-1337, 1992]. In this approach, the computation of Brunovsky forms and transformation matrices and the proof of their existence and uniqueness arc carried out simultaneously. In addition, it is shown that quadratic transformations in the aforementioned paper can be simplified to prevent multiplicity in Brunovsky forms. This method is extended for studying discrete quadratic systems. Finally, computation algorithms for both continuous and discrete systems are summarized, and examples demonstrated.

Cite

CITATION STYLE

APA

Jin, W. L. (2005). A method for computing quadratic Brunovsky forms. Electronic Journal of Linear Algebra, 13, 40–55. https://doi.org/10.13001/1081-3810.1149

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free