Research Article  Open Access
Appukuttan K. K., Suma Bhat, "An Alternate Method for Computation of Transfer Function Matrix", Journal of Control Science and Engineering, vol. 2010, Article ID 789404, 3 pages, 2010. https://doi.org/10.1155/2010/789404
An Alternate Method for Computation of Transfer Function Matrix
Abstract
A direct and simple numerical method is presented for calculating the transfer function matrix of a linear time invariant multivariable system (A, B, C). The method is based on the matrixdeterminant identity, and it involves operations with an auxiliary vector on the matrices. The method is computationally faster compared to Liverrier and Danilevsky methods.
1. Introduction
In the design of multivariable control systems by frequency domain methods, the computation of the transfer function matrix from the state space description of the system plays an important role. The computation based on Liverrier method [1] is regarded as unsatisfactory especially when the system order is high or its eigenvalues are widely distributed. Patel [2] has presented a method whereby each numerator element of the transfer function matrix is calculated as the difference between the characteristic polynomials of two matrices which are related to the system state matrix, and the polynomials are computed by the method of Danilevsky [1]. Danilevsky method is used in many numerically intensive calculations where extreme eigenvalues have to be estimated [3–5]. Daly [6] has given a method for the transfer function matrix evaluation which involves a sequence of similarity transformations on the Rosenbrock system matrix [7] and resembles Danilevsky technique.
This paper, instead of using the Danilevsky method, presents a direct procedure to compute the characteristic polynomials associated with each numerator element of the transfer function matrix. The method makes use of an auxiliary output vector and the corresponding singleoutput system is transformed to its row companion form to give the coefficients of the characteristic polynomial. The above transformation is carried out by the algorithm given by Hickin and Sinha [8] which is based on the transformation of a matrix to its Hermite normal form.
2. Transfer Function Matrix
Consider the thorder, inputs, outputs, lineartime invariant system described by where , , and are matrices of appropriate dimensions. The transfer function matrix of the system is given by where is the numerator transfer function matrix and is the characteristic polynomial. Any typical element of is Using the matrixdeterminant identity [9] where is an matrix and and are and vectors, respectively. can be expressed as: Patel [2] has suggested the method of Danilevsky for computing the polynomials in (5). A simple and direct method to compute the coefficients of the polynomials is given below.
3. Characteristic Polynomial of A
For a given matrix A, let represent auxiliary output vector such that is observable. Form the matrix:
For the above singleoutput system, the transformation of to its row companion form will result in a canonical form where the first rows will be unit vectors appearing in their natural order and the elements of the last row will be the coefficients of the characteristic polynomial of . Thus, can be obtained directly from the row companion form representation of .
The transformation of the matrix to its row companion form is done in n steps on a row basis starting from the first row. For each row select the element as pivot and calculate where is a unit row vector. Each step of transformation will result in the elements of the row being expressed as the unit vector .
After the step transformation, the matrix will be in the Hermite normal form where the unit row vectors appear in their natural order in the first rows and the elements of the last row will be (). Thus, the coefficients of the characteristic polynomial of are obtained.
The polynomial of degree corresponding to the element is obtained as the difference between the characteristic polynomials of and . Thus in all , characteristic polynomials have to be computed to evaluate the complete transfer function matrix .
4. Numerical Example One
4.1. Computation of
Let as per (6): The transformation with (7) gives Hence .
4.2. To Find the Element of
The characteristic polynomial of is computed using (6) and (7) and is . Hence the elements as per (5) are . Similarly all the other elements of can be computed.
5. Numerical Example Two
The jet engine model which used NEC International form [10] is considered to compare the numerical properties of the present method with other known methods. The fifthorder model of the jet engine is considered for computing the coefficients of the characteristic polynomial. The state matrix is: The computation was done on FORTRAN program, and results are shown in Table 1. In the above matrix , the ratio between the largest and the smallest element is of the order 10^{5}. The present method gives identical results as the Danilevsky method, whereas the Liverrier method shows a small difference in the coefficients values in the last two rows. The execution time for Liverrier, Danilevsky, and present methods was found to be 0.43, 0.36, and 0.14 seconds, respectively. The eigenvalues are −174.653, −10, −6.671 + 1.293, −6.671 − 1.293, and −2.629. The eigenvalues computed by MATLAB are in agreement with the above results.

6. Conclusions
A simple and direct method of computing the transfer function matrix of the system has been presented. All the () polynomials of the transfer function matrix are computed from the characteristic polynomials of matrices related to the system state matrix. The coefficients of the above polynomials have been evaluated by a simple transformation of an auxiliary singleoutput system to its row companion form. The transformation is easily programmed on the computer.
References
 D. K. Faddeev and V. N. Faddeeva, Computational Methods of Linear Algebra, Freeman, San Francisco, Calif, USA, 1963.
 R. V. Patel, “On the computation of numerator transfer functions of linear systems,” IEEE Transactions on Automatic Control, vol. 18, no. 4, pp. 400–401, 1973. View at: Google Scholar
 S. L. Liu and S. Y. Wang, “Sensitivity analysis of nonnegative irreducible matrices,” Applied Mathematics Letters, vol. 12, no. 2, pp. 121–124, 1999. View at: Google Scholar
 H. R. Dullin and A. V. Tsygvintsev, “On the analytical integrity of the rattleback problem,” Annales de la Faculte des Sciences de Toulouse Ser, vol. 6, no. 17, pp. 495–517, 2008. View at: Google Scholar
 M. Nalbant, H. Gökkaya, I. Toktaş, and G. Sur, “The experimental investigation of the effects of uncoated, PVD and CVDcoated cemented carbide inserts and cutting parameters on surface roughness in CNC turning and its prediction using artificial neural networks,” Robotics and ComputerIntegrated Manufacturing, vol. 25, no. 1, pp. 211–223, 2009. View at: Publisher Site  Google Scholar
 K. C. Daly, “A Computational procedure for transfer function evaluation,” International Journal of Control, vol. 20, no. 4, pp. 569–576, 1974. View at: Google Scholar
 H. H. Rosenbrock, State Space and Multivariable Theory, Nelson, Ontario, Canada, 1970.
 J. Hickin and N. K. Sinha, “On the transformation of linear multivariable systems to canonical forms,” International Journal of Systems Science, vol. 10, no. 7, pp. 783–796, 1979. View at: Google Scholar
 I. W. Sandberg, “On the theory of linear multiloop feedback systems,” Bell System Technical Journal, vol. 42, pp. 355–382, 1963. View at: Google Scholar
 R. J. Miller and R. D. Hackney, F16 Multivariable Control System Models/Design Criteria, Fla, USA, Pratt and Whitney Aircraft Group, United Technologies Corporation, 1976.
Copyright
Copyright © 2010 Appukuttan K. K. and Suma Bhat. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.