Fast error-free algorithm for the determination of kernels of the periodic Volterra representation (Q913460): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 18:05, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast error-free algorithm for the determination of kernels of the periodic Volterra representation |
scientific article |
Statements
Fast error-free algorithm for the determination of kernels of the periodic Volterra representation (English)
0 references
1990
0 references
An algorithm is proposed for calculating the kernels of the periodic Volterra representation of discrete nonlinear systems. No a priori knowledge of the system to be identified is assumed. The operation of division is avoided and the only steps that introduce the round-off errors appear at the very end. Considerable execution time of the algorithm is compensated by its relative simplicity and implementability.
0 references
fast error-free algorithm
0 references
algorithm
0 references
periodic Volterra representation
0 references
discrete nonlinear systems
0 references