Abstract
A reduced complexity algorithm, which is an adaptive version of the Matching Pursuit algorithm, is proposed for the identification of nonlinear systems. The algorithm is demonstrated on various nonlinear systems presented in the literature. The results are favorable compared to other nonlinear identification methods (e.g. Neural Nets). It is demonstrated that the algorithm could be used for the design of adaptive controllers.
| Original language | English |
|---|---|
| Pages | 499-502 |
| Number of pages | 4 |
| State | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel - Jerusalem, Isr Duration: 5 Nov 1996 → 6 Nov 1996 |
Conference
| Conference | Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel |
|---|---|
| City | Jerusalem, Isr |
| Period | 5/11/96 → 6/11/96 |