Squared and absolute errors in optimal approximation of nonlinear systems

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 L₂(−1,1) and L₁(−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.