Symbolic computation in nonlinear control systems analysis: The example of bilinearization
This paper contributes to the development of symbolic computation for nonlinear control and design, by first reviewing some standard tools for analysis, and then focusing on the specific problem of bilinearization up to output injection. The symbolic computability of a bilinearizability test is proved, underlining the main advantages and some basic weaknesses of symbolic computation when applied to nonlinear control problems. An outcome of this research is a computational tool using Mathematica, which checks bilinearization of SISO nonlinear systems affine in the control.
Year of publication: |
1997
|
---|---|
Authors: | Besançon, Gildas ; Bornard, Guy |
Published in: |
Mathematics and Computers in Simulation (MATCOM). - Elsevier, ISSN 0378-4754. - Vol. 44.1997, 1, p. 11-27
|
Publisher: |
Elsevier |
Subject: | Symbolic computation | Bilinearization | Observability | Nonlinear systems | Mathematica |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Summations of polylogarithms via evaluation transform
Minh, Hoang Ngoc, (1996)
-
Symbolic stationarization of dynamic equilibrium models
Canova, Fabio, (2021)
-
More power through symbolic computation: Extending Stata by using the Maxima computer algebra system
Magno, Giovanni L. Lo, (2015)
- More ...
Similar items by person