论文信息 - Least-squares moment matching reduction methods

Least-squares moment matching reduction methods

It is shown how the two apparently different approaches to modelling reduction by least-squares time moment matching give identical results. This property also enables a clear understanding of how the method actually approximates the system. Computational savings are seen to be made by adopting the two-stage approach.

T. N. Lucas | I. D. Smith

[1] Adhemar Bultheel,et al. Pade´ techniques for model reduction in linear system theory: a survey , 1986 .

[2] T. N. Lucas,et al. Model reduction by generalised least-squares method , 1991 .

[3] T. N. Lucas,et al. Model reduction by least-squares moment matching , 1990 .

[4] H. Takeda,et al. Model reduction for a class of linear dynamic systems , 1985 .

[5] Luis A. Aguirre,et al. The least squares Padé method for model reduction , 1992 .

[6] T. T. Hartley,et al. Least squares model reduction , 1992 .