2002Unpublished venueRequires access

Identification by Chebyshev polynomials for discrete noisy nonlinear systems

Tadatoshi Shingu, H. Takata

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Chebyshev polynomials, Chebyshev nodes, Chebyshev filter, Chebyshev equation, Akaike information criterion, Mathematics, Applied mathematics, Nonlinear system

Related papers

Back to paper searchBrowse research topicsOriginal source
Identification by Chebyshev polynomials for discrete noisy nonlinear systems — Research Paper | ScholarLens