Reduced rank Volterra filter for robust identification of nonlinear systems (Q2702519)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reduced rank Volterra filter for robust identification of nonlinear systems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reduced rank Volterra filter for robust identification of nonlinear systems |
scientific article |
Statements
8 January 2002
0 references
robustness
0 references
kernel identification
0 references
reduced rank polynomial filter
0 references
Volterra filter
0 references
mean square error
0 references
computational complexity
0 references
estimation accuracy
0 references
Reduced rank Volterra filter for robust identification of nonlinear systems (English)
0 references
The reduced rank polynomial filter (a vector-valued polynomial operator with dominant kernel) is studied. A Volterra filter is a polynomial operator that minimizes the mean square error between its output for a given reference random variable and the desired random variable to be approximated. It is postulated that a drastic reduction of computational complexity is achieved by the rank reduction. This rank reduction can make polynomial filters more robust to noise by restricting the influence of higher order multiplications of noise. An explicit formula is given to determine recursively all the coefficient matrices of the optimal reduced rank polynomial filter with minimal mean square error. A numerical example indicates that the proposed method realizes well trade-off between the computational complexity and the estimation accuracy. All proofs are omitted, they will be shown in a later paper.NEWLINENEWLINEFor the entire collection see [Zbl 0952.00062].
0 references