Transfer Function Reduction

1976 ◽  
Vol 190 (1) ◽  
pp. 643-651 ◽  
Author(s):  
R. Whalley

SYNOPSIS A method of generating reduced order models from the Laurent series expansion of a transfer function is examined by means of the Hankel Matrix and its correspondence to the field of rational functions. The approach enables particularly simple results to be derived regarding the composition of the reduced form and the avoidance of non minimum phase characteristics therein.

2013 ◽  
Vol 61 (12) ◽  
pp. 805-817
Author(s):  
Achim Ilchmann ◽  
Fabian Wirth

Abstract We discuss the concept of `minimum phase' for scalar semi Hurwitz transfer functions. The latter are rational functions where the denominator polynomial has its roots in the closed left half complex plane. In the present note, minimum phase is defined in terms of the derivative of the argument function of the transfer function. The main tool to characterize minimum phase is the Hurwitz reflection. The factorization of a weakly stable transfer function into an all-pass and a minimum phase system leads to the result that any semi Hurwitz transfer function is minimum phase if, and only if, its numerator polynomial is semi Hurwitz. To characterize the zero dynamics, we use the Byrnes-Isidori form in the time domain and the internal loop form in the frequency domain. The uniqueness of both forms is shown. This is used to show in particular that asymptotic stable zero dynamics of a minimal realization of a transfer function yields minimum phase, but not vice versa.


1997 ◽  
Vol 119 (4) ◽  
pp. 685-690 ◽  
Author(s):  
T. N. Lucas

A frequency-domain multipoint Pade´ approximation method is given that produces optimal reduced order models, in the least integral square error sense, which are constrained to match the initial time response values of the full and reduced systems for impulse or step inputs. It is seen to overcome a perceived drawback of the unconstrained optimal models, i.e., that they do not guarantee a proper rational reduced order transfer function for a step input. The method is easy to implement when compared to existing constrained optimal methods, and consists of solving only linear sets of equations in an iterative process. It is also seen to be a natural extension of an existing optimal method. Numerical examples are given to illustrate its application.


1990 ◽  
Vol 112 (2) ◽  
pp. 292-297 ◽  
Author(s):  
Chyi Hwang ◽  
Ching-Shieh Hsieh

In this paper, a method of combining the Routh approximation method with the bilinear transformation is presented for deriving stable reduced-order models of a strictly proper z-transfer function Gn(z). It is based on applying the bilinear transformation to the (z+1)Gn(z), and then deriving a new bilinear Routh γ − δ canonical expansion for Gn(z). The proposed bilinear Routh approximation method has all the advantages of the Routh approximation method [5] while without having initial-value problem caused by the bilinear transformation. A numerical example is included to illustrate the procedure.


AIAA Journal ◽  
1999 ◽  
Vol 37 ◽  
pp. 1318-1325 ◽  
Author(s):  
Michael I. Friswell ◽  
Daniel J. Inman

Sign in / Sign up

Export Citation Format

Share Document