MODEL REDUCTION BY BEST TSCHEBYSCHEFF RATIONAL APPROXIMATIONS IN THE COMPLEX PLANE

被引:2
作者
BISTRITZ, Y
LANGHOLZ, G
机构
[1] School of Engineering, Tel-Aviv University, Tel-Aviv
关键词
D O I
10.1080/00207177908922774
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Reduced order models of high-order single-input single-output dynamical systems are derived in terms of best Chebyshev rational approximations on a desired domain in the complex plane. An algorithm is proposed for deriving local best Chebyshev rational approximations for a complex function in the cornplex plane and is based on a complex version of Lawson's algorithm. The method is applied to minimizing a time response error bound of the reduced models and it is shown that the local best Chebyshev approximations BTe in fact frequency-response approximations. The algorithm enables the control of the rational approximation pole and zero locations and, therefore, if the given system is stable, its reduced order models can be made stable aa well as minimal phase. © 1979 Taylor & Francis Ltd.
引用
收藏
页码:277 / 289
页数:13
相关论文
共 8 条
[1]  
BISTRITZ Y, 1977, THESIS TEL AVIV U
[2]   LINEAR CHEBYSHEV-APPROXIMATION IN COMPLEX PLANE USING LAWSONS ALGORITHM [J].
ELLACOTT, S ;
WILLIAMS, J .
MATHEMATICS OF COMPUTATION, 1976, 30 (133) :35-44
[3]  
FELLOWS DM, 1974, RES REPORT FACULTY E
[4]  
Lorentz G.G., 1966, Approximation of Functions
[5]   LAWSON ALGORITHM AND EXTENSIONS [J].
RICE, JR ;
USOW, KH .
MATHEMATICS OF COMPUTATION, 1968, 22 (101) :118-&
[6]  
TEASDALE RD, 1953, IRE CONVENTION RECOR, V1, P89
[7]  
Walsh JL., 1956, INTERPOLATION APPROX
[8]  
1970, SCI SUBROUTINES PACK