Identification by Chebyshev polynomials for discrete noisy nonlinear systems
Tadatoshi Shingu, H. Takata
Abstract
Tadatoshi Shingu, H. Takata
Abstract
We propose an identification method of discrete noisy nonlinear systems using Chebyshev polynomials. The nonlinear function is represented by the linear combination of some Chebyshev polynomials. Each coefficient of the Chebyshev polynomials is easily evaluated by the least squares method. An error bound of the identification is also estimated. Also the optimal order of the Chebyshev polynomials is determined by using Akaike's information criterion. Numerical examples demonstrate that the accuracy of this identification for nonlinear systems is considerably improved.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We propose an identification method of discrete noisy nonlinear systems using Chebyshev polynomials. The nonlinear function is represented by the linear combination of some Chebyshev polynomials. Each coefficient of the Chebyshev polynomials is easily evaluated by the least squares method. An error bound of the identification is also estimated. Also the optimal order of the Chebyshev polynomials is determined by using Akaike's information criterion. Numerical examples demonstrate that the accuracy of this identification for nonlinear systems is considerably improved.
Key concepts: Chebyshev polynomials, Chebyshev nodes, Chebyshev filter, Chebyshev equation, Akaike information criterion, Mathematics, Applied mathematics, Nonlinear system