Symbolics for Control: Maple used in
Solving the Exact Linearization Problem
Bram de Jager
Faculty of Mechanical Engineering, WH 2.137,
Eindhoven University of Technology, P.O. Box 513,
5600 MB Eindhoven, The Netherlands
In this paper the problem of exact linearization of
dynamic systems by application of a suitable controller is discussed.
Algorithms that are instrumental in solving this problem are
implemented in the so-called NlCa package,
based on the symbolic computation program Map.
Four examples are presented to illustrate the use of NlCa.
They show that this package is a useful tool for the automated
design of changes of coordinates and state-feedbacks
that solve the exact linearization problem.
The limited capability to solve partial differential equations
is a bottleneck.
Recommendations to improve NlCa and to make
Map more suitable for implementations like this one are given.
Computer Algebra in Industry 2 Edited by A.M. Cohen, L. van Gastel and
S.M. Verduyn Lunel
© 1995 John Wiley & Sons Ltd
Reproduced by permission of John Wiley & Sons Ltd, 1995
Computer Algebra in Industry 2
Last Update: June 23, 1997.