Symbolic computation in nonlinear control systems analysis: The example of bilinearization

Gildas Besançon and Guy Bornard

Mathematics and Computers in Simulation (MATCOM), 1997, vol. 44, issue 1, 11-27

Abstract: 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.

Keywords: Symbolic computation; Bilinearization; Observability; Nonlinear systems; Mathematica (search for similar items in EconPapers)
Date: 1997
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475497000037
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:44:y:1997:i:1:p:11-27

DOI: 10.1016/S0378-4754(97)00003-7

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().