The \(\epsilon\)-algorithm for the identification of a transfer-function model: Some applications (Q1895880)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 784463
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(\epsilon\)-algorithm for the identification of a transfer-function model: Some applications |
scientific article; zbMATH DE number 784463 |
Statements
The \(\epsilon\)-algorithm for the identification of a transfer-function model: Some applications (English)
0 references
4 February 1996
0 references
When dynamic relations between time series have a finite dimension, they can be represented by means of transfer functions. One of the questions which then occur in this kind of modelling of multi-input-multi-output systems is the estimation of the orders of the polynomials so involved. Loosely speaking there are two main classes of methods. One in which one estimates the coefficients of the process, and the other one which involves indirect techniques related with Padé approximation. The authors give a characterization of the degrees in a minimal ARMA model through the observation of certain tables of values, which are built from the autocorrelations of the observed process.
0 references
identification of a transfunction model
0 references
epsilon algorithm
0 references
time series
0 references
transfer functions
0 references
multi-input-multi-output systems
0 references
Padé approximation
0 references
minimal ARMA model
0 references
0 references
0.7825257778167725
0 references
0.7750282287597656
0 references
0.7705701589584351
0 references
