Trudy SPIIRAN
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Informatics and Automation:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Trudy SPIIRAN, 2020, Issue 19, volume 2, Pages 330–356
DOI: https://doi.org/10.15622/sp.2020.19.2.4
(Mi trspy1101)
 

Mathematical Modeling, Numerical Methods

Computational algorithms for reducing rational transfer functions' order

M. Gourary, S. Rusakov, M. Zharov, S. Ulyanov

Federal State-Funded Institution of Science Institute for Design Problems in Microelectronics of Russian Academy of Sciences (IPPM RAS)
Abstract: 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.
Keywords: linear systems, model reduction, transfer function, rational approximation.
Received: 01.07.2019
Document Type: Article
UDC: 004.942 + 517.518.843 + 519.654
Language: Russian
Citation: M. Gourary, S. Rusakov, M. Zharov, S. Ulyanov, “Computational algorithms for reducing rational transfer functions' order”, Tr. SPIIRAN, 19:2 (2020), 330–356
Citation in format AMSBIB
\Bibitem{GouRusZha20}
\by M.~Gourary, S.~Rusakov, M.~Zharov, S.~Ulyanov
\paper Computational algorithms for reducing rational transfer functions' order
\jour Tr. SPIIRAN
\yr 2020
\vol 19
\issue 2
\pages 330--356
\mathnet{http://mi.mathnet.ru/trspy1101}
\crossref{https://doi.org/10.15622/sp.2020.19.2.4}
Linking options:
  • https://www.mathnet.ru/eng/trspy1101
  • https://www.mathnet.ru/eng/trspy/v19/i2/p330
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Informatics and Automation
    Statistics & downloads:
    Abstract page:130
    Full-text PDF :68
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024