Inversion algorithm for recursive nonlinear systems
The purpose of this paper is to study the right invertibility problem for a nonlinear system (called recursive nonlinear system (RNS)) described by a higher-order difference equation relating the inputs, outputs and a finite number of their time-shifts: NEWLINE\[NEWLINE y(t) = F(y(t - 1),\dots , y(t - \mu), u(t - 1),\dots , u(t - \nu)). NEWLINE\]NEWLINE Right invertibility means the possibility of generating a prespecified sequence at system output by suitably choosing the input sequence. In the study the author follows the approach where the notion of rank plays the key role. This notion was introduced by Fliess for continuous-time systems and is extended to RNS. It is shown that the inversion algorithm provides the means to compute the rank of the system. Necessary and sufficient conditions for local right invertibility in terms of the rank of the system are proposed.
- A note on the invertibility of nonlinear input-output differential systems
- An algorithm for the pseudoinversion of dynamic systems
- Popov form and the explicit equations of inverse systems
- scientific article; zbMATH DE number 3856929 (Why is no real title available?)
- scientific article; zbMATH DE number 4170744 (Why is no real title available?)
- Solvability and Right-Inversion of Implicit Nonlinear Discrete-Time Systems
- scientific article; zbMATH DE number 24458 (Why is no real title available?)
- scientific article; zbMATH DE number 1011036 (Why is no real title available?)
- Input-output decoupling of discrete-time nonlinear systems by dynamic measurement feedback
This page was built for publication: Inversion algorithm for recursive nonlinear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2704997)