\(L^\infty\) system approximation algorithms generated by \(\varphi\) summations (Q1129710)

From MaRDI portal





scientific article; zbMATH DE number 1192935
Language Label Description Also known as
default for all languages
No label defined
    English
    \(L^\infty\) system approximation algorithms generated by \(\varphi\) summations
    scientific article; zbMATH DE number 1192935

      Statements

      \(L^\infty\) system approximation algorithms generated by \(\varphi\) summations (English)
      0 references
      0 references
      20 August 1998
      0 references
      The authors discuss linear \(L^\infty\)-approximation of systems from noisy frequency-domain data. The models are based on discrete partial sum operators generated by \(\varphi\)-summations (like Fejér and La Vallée-Poussin as special cases). The main result of the paper consists in the derivation of upper bounds for such operators and for the approximation error as a function of a specific norm of the Fourier transform of the window \(\varphi\). It has also been shown that the rate of convergence of the approximation error depends on the moments of the Fourier transform of \(\varphi\). The result can be used to design the first step of a two-step approximate \({\mathcal H}^\infty\) identification method with desired approximation and convergence properties.
      0 references
      discrete Fourier sequences
      0 references
      \(L^\infty\)-approximation
      0 references
      noisy frequency-domain data
      0 references
      \(\varphi\)-summations
      0 references
      Fourier transform
      0 references
      \({\mathcal H}^\infty\) identification
      0 references
      0 references
      0 references
      0 references

      Identifiers