Squared and absolute errors in optimal approximation of nonlinear systems

  • Mäkilä P
  • 4

    Readers

    Mendeley users who have this article in their library.
  • 7

    Citations

    Citations of this article.

Abstract

Optimal squared error and absolute error-based approximation problems for static polynomial models of nonlinear, discrete-time, systems are studied in detail. These problems have many similarities with other linear-in-the-parameters approximation problems, such as with optimal approximation problems for linear time-invariant models of linear and nonlinear systems. Nonprobabilistic signal analysis is used. Close connections between the studied approximation problems and certain classical topics in approximation theory, such as optimal L2(-1,1) and L1(-1,1) approximation, are established by analysing conditions under which sample averages of static nonlinear functions of the input converge to appropriate Riemann integrals of the static functions. These results should play a significant role in the analysis of corresponding system identification and model validation problems. Furthermore, these results demonstrate that optimal modelling based on the absolute error can offer advantages over squared error-based modelling. Especially, modelling problems in which some signals possess heavy tails can benefit from absolute value-based signal and error analysis. © 2003 Elsevier Ltd. All rights reserved.

Author-supplied keywords

  • Approximation
  • Nonlinear systems
  • Optimal approximation
  • Static nonlinearities

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Pertti M. Mäkilä

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free