z-logo
open-access-imgOpen Access
Computational Algorithms for Reducing Rational Transfer Functions’ Order
Author(s) -
M.M. Gourary,
С. Г. Русаков,
Михаил Михайлович Жаров,
S.L. Ulyanov
Publication year - 2020
Publication title -
trudy spiiran
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 9
eISSN - 2078-9599
pISSN - 2078-9181
DOI - 10.15622/sp.2020.19.2.4
Subject(s) - mathematics , transfer function , approximation error , orthogonalization , function (biology) , error function , function approximation , mathematical optimization , algorithm , computer science , evolutionary biology , machine learning , artificial neural network , electrical engineering , biology , engineering
A problem of reducing a linear time-invariant dynamic system is considered as a problem of approximating its initial rational transfer function with a similar function of a lower order. The initial transfer function  is also assumed to be rational. The approximation error is defined as the standard integral deviation of the transient characteristics of the initial and reduced transfer function in the time domain. The formulations of two main types of approximation problems are considered: a) the traditional problem of minimizing the approximation error at a given order of the reduced model; b) the proposed problem of minimizing the order of the model at  a given tolerance on the approximation error. Algorithms for solving approximation problems based on the Gauss-Newton iterative process are developed. At the iteration step, the current deviation of the transient characteristics is linearized with respect to the coefficients of the denominator of the reduced transfer function. Linearized deviations are used to obtain new values of the transfer function coefficients using the least-squares method  in a functional space based on Gram-Schmidt orthogonalization. The general form of expressions representing linearized deviations of transient characteristics is obtained. To solve the problem of minimizing the order of the transfer function in the framework of the least squares algorithm, the Gram-Schmidt process is also used. The completion criterion of the process is to achieve a given error tolerance. It is shown that the sequence of process steps corresponding to the alternation of coefficients of polynomials of the numerator and denominator of the transfer function provides the minimum order of transfer function. The paper presents an extension of the developed algorithms to the case of a vector transfer function with a common denominator. An algorithm is presented with the approximation error defined in the form of a geometric sum of scalar errors. The use of the minimax form for error estimation and the possibility of extending the proposed approach to the problem of reducing the irrational initial transfer function are discussed. Experimental code implementing the proposed algorithms is developed, and the results of numerical evaluations of test examples of various types are obtained.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here