Nonparametric identification of a cascade nonlinear time series system (Q2277418): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q118592625 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0165-1684(91)90029-i / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1974842604 / rank | |||
Normal rank |
Latest revision as of 10:35, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nonparametric identification of a cascade nonlinear time series system |
scientific article |
Statements
Nonparametric identification of a cascade nonlinear time series system (English)
0 references
1991
0 references
This paper is generally a well written paper. It describes a nonparametric identification of a Hammerstein system, which is composed of a memoryless, odd nonlinearity, driven by a stationary random process and a linear asymptotically stable system, cascaded to the nonlinearity. An algorithm is described to identify the linear system. A nonrelated algorithm is derived to identify the nonlinear part, both for the stationary and nonstationary cases. This algorithm is based on using Legendre orthogonal polynomials as bases for the nonlinear estimate, as opposed to the authors previous approach of using kernel estimates. Convergence rate of \(O(n^{-2/3})\) is established, slightly worse than the convergence rate for parametric algorithms (generally requiring the inversion of a matrix) of \(O(n^{-1})\). Faster convergence rates can be attained by posing stricter continuity condition on the nonlinearity. The convergence rate of the authors kernel algorithm of \(O(n^{-4/5})\) can thus be reached and surpassed. Even stricter continuity conditions on the nonlinearity allow the convergence rate to approach that of parametric algorithms. Results derived are supported by various simulation results. One problem left for future study is how to choose the optimum number of Legendre polynomials, the cost function has shown strong oscillatory behavior in some cases.
0 references
nonparametric identification
0 references
Hammerstein system
0 references
Legendre orthogonal polynomials
0 references