论文信息 - Discrete Fourier transform and H/sub infinity / approximation

Discrete Fourier transform and H/sub infinity / approximation

It is shown that uniform rational approximation of nonrational transfer functions can always be obtained by means of the discrete Fourier transform (DFT) as long as such approximants exist. Based on this fact, it is permissible to apply the fast Fourier transform (FFT) algorithm in carrying out rational approximations without being apprehensive of convergence. The DFT is used to obtain traditional approximations for transfer functions of infinite-dimensional systems. Justification is provided for using the DFT in such approximations. It is established that whenever a stable transfer function can be approximated uniformly on the right half-plane by a rational function, its approximants can always be recognized by means of a DFT. >

N. E. Wu | G. Gu | G. Gu | N. Wu

[1] M. Kreĭn,et al. Infinite hankel matrices and generalized carathéodory — fejer and riesz problems , 1968 .

[2] B. Moore. Principal component analysis in linear systems: Controllability, observability, and model reduction , 1981 .

[3] E. Kamen,et al. Stabilization of time-delay systems using finite-dimensional compensators , 1985, IEEE Transactions on Automatic Control.

[4] J. Lam,et al. Balanced realisation and Hankel-norm approximation of systems involving delays , 1986, 1986 25th IEEE Conference on Decision and Control.

[5] E. Lee,et al. Feedback minimax synthesis for distributed systems , 1988, Proceedings of the 27th IEEE Conference on Decision and Control.

[6] R. Curtain,et al. L ∞ approximation and nuclearity of delay systems , 1988 .

[7] Ruth F. Curtain,et al. Partial fraction expansions for delay systems , 1988 .

[8] R. Curtain,et al. Realisation and approximation of linear infinite-dimensional systems with error bounds , 1988 .

[9] P. Khargonekar,et al. Approximation of infinite-dimensional systems , 1989 .