SOME REMARKS ON PADÉ-APPROXIMATIONS

M.Vajta

Department of Mathematical Sciences

University of Twente

P.O.Box 217, 7500 AE Enschede

The Netherlands

e-mail: m.vajta@math.utwente.nl

 

 

ABSTRACT

Padé approximations are widely used to approximate a dead-time in continuous control systems. It provides a finite-dimensional rational approximation of a dead-time. However, the standard Padé approximation (recommended in many textbooks) with equal numerator- and denominator degree, exhibits a jump at time t=0. This is highly undesirable in simulating dead-times. To avoid this phenomena we shall reconsider the Padé approximation with different numerator degrees.

Keywords: Padé approximation, rational functions.

 

1. INTRODUCTION

 

There are many physical processes with dead-time. For example virtually all chemical processes involves some time delay and all transport processes also exhibit dead-time [3,12]. Control systems with dead-time are difficult to analyze and simulate. One of the reasons is that a closed-loop control system with dead-time is in fact an infinite dimensional system, i.e. the closed-loop has infinite number of poles [3,6]. It is also difficult to determine all the system poles. One of the most widely recommended remedies to overcome this difficulty is to approximate the dead-time by some method and analyze the resulting system [6,8]. The step-response of a dead-time is a delayed step-signal h(t) = 1(t-T) where T denotes the dead-time. The Laplace transform of h(t) = 1(t-T) is:

(1)

Among the many methods Padé approximations are the most frequently used methods to approximate a dead-time by a rational function. Almost every textbook about classical control system theory provides the basic relation, but usually only for an approximation with equal numerator and denominator degree (try for example the subroutine pade.m in MATLAB). The most widely recommended Padé approximation is of 2nd order with equal numerator- and denominator degree [6,8]:

(2)

It is a bit puzzling to realize, that the step-response of this approximation (say, transfer function) exhibits a jump at t=0 due to the equal numerator and denominator degree. That is, instead of delaying the input signal there appear an output signal at t=0. This seems to be quite bad. On the other hand, this approximation has nice properties in the frequency domain. So one may ask: is it possible to modify the approximation avoiding the jump at t=0 but keeping the frequency domain properties?

 

 

2. APPROXIMATIONS WITH CONSTANT NUMERATOR

There are many ways of approximating e-sT by a rational function. Consider for example its Maclaurin series [1,11]. By taking only the first n-terms we can define the following approximation:

(3)

This formula is recommended in Kuo [pp.183] and in Palm [pp.509]. Although the expression seems natural to apply, an unexpected difficulty arises as one increases the degree of approximation. The rational function R0,n(s) exhibits right-half-plane poles as n increases, namely as n>4! Although the approximation's accuracy increases as n increases in the s-domain, but as a transfer function R0,n(s) becomes unstable. This is a rarely known phenomenon and makes the seemingly simple approximation useless for n>4. Consider for example the first 5 terms (5th order approximation):

(4)

The poles of this rational function are: p1,2 = 0,23981± i 3,12834; p3,4 = -1,44180± i 2,43452 and p5 = -2,1806. Since there are two conjugate complex poles on the right-half plane, this "approximation" is unstable!

Another method recommended in some textbooks [8, pp.521; 13, pp.216] is based on the infinite product formula of the exponential function [11]. Taking only the first n terms in the product leads to the following approximation:

(5)

This approximation has multiple poles (with multiplicity n) at pn = -n/T. In fact, equation (5) gives a rather poor approximation for low value of n [13,14]. Without going into more details, we can conclude, these simple approximations (without numerator dynamics) give poor approximations of a dead-time. One may expect to improve the accuracy by choosing an appropriate numerator.

 

3. PADÉ APPROXIMATION OF e-x

The approximations given in the previous paragraph are rational functions but with zero numerator dynamics (numerator is constant). We shall now consider another kind of approximations, namely, approximations derived by expanding a function as a ration of two power series (thus with numerator and denominator dynamics). These approximations are usually called Padé approximants. They are usually superior to Taylor expansions when functions contain poles, because the use of rational functions allows them to be well-represented. Let us now consider the general equations of the Padé approximation. Let A(x) denote a function having a Maclaurin series expansion [1,2]:

(6)

which converges in some neighborhood of the origin. The Padé approximation of order (m,n) to A(x) is defined to be a rational function Rm,n(x) expressed in a fractional form:

 

(7)

where Pm(x) and Qn(x) are two polynomials:

(8)

The unknown coefficients p0 ... pm and q0 ... qn of Rm,n(x) can be determined from the condition that the first (m+n+1) terms vanish in the Maclaurin series:

or (9)

Substituting the two polynomials into this expression and equating the coefficients leads to a system of m+n+1 linear homogeneous equation [2] which can be expressed in matrix form (assuming q0=1):

(10)

Now we would like to apply this to the exponential function with the Maclaurin series:

(11)

We conclude that the coefficient ak = (-1)k/k!. In this case the polynomials Pm(x) and Qn(x) of the Padé approximation Rm,n(x) can be expressed by the following recursive relations [4]:

(12)

and

(13)

Note, that the numerator coefficients have always alternating sign and Pn(x) = Qn(-x) for m=n. As a consequence, the zeros and poles of Rn,n(x) are symmetrical to the imaginary axes!

 

4. PADÉ APPROXIMATIONS OF e-sT

 

To determine the transfer functions of the Padé approximations with different numerator degree, one simply substitutes x=sT into (12) and (13). For example, the 4th order approximation with 3rd order numerator can be expressed as [14]:

(14)

Note, that the nth order Padé approximation has different denominator polynomials depending on the numerator's degree. It is interesting to determine the pole-zero configuration of the approximation. Figure 1 shows the pole-zero configuration of the 4th order Padé approximation with different numerator degree. Note, that all poles are on the left-half-plane and all zeros are on the right-half-plane. Notice, that the poles and zeros of the Padé approximation R4,4(s) are symmetrical to the imaginary axis and are close to a circle.

Due to the symmetrical pole-zero configuration, the phase of Rn,n(s) goes to -2np /2 and its amplitude remains constant at all frequencies. On the other hand, the step-response of Rn,n(s) exhibits a jump at t=0 which is not very desirable. To avoid the jump in the step-response we recommend to use Rn-1,n(s) instead of Rn,n(s). In Table 1 we give the transfer functions of both up to 5th order. However, there is a price to be paid: due to the lower numerator's degree, the phase of Rn-1,n(s) goes to -(m+n)p /2 only and its amplitude goes to zero at very high frequencies. But all in all, Rn-1,n(s) seems to be a good compromise.

Figure 2 shows the step-responses of Rn-1,n(s) and Rn,n(s). One can easily see that Rn-1,n(s) gives a better approximation in the time-domain [14], specially in the interval [0,T]. As a measure of the error we give in Table 2 the mean-square-errors defined in the time-domain by:

(15)

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Figure 1. Pole-zero configuration of the 4th order Padé approximation with different numerator degree.

All poles are on the left-half-plane and all zeros are on the right-half-plane.

( □ = R1,4(s); x = R2,4(s); ∆ = R3,4(s); o = R4,4(s) )

 

 

 

n

Rn-1,n(s)

Rn,n(s)

1

2

3

4

5

Table 1. Transfer functions Rn-1,n(s) and Rn,n(s) of the Padé approximations.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Figure 1. Step responses of the Padé approximations with different order.

 

 

Figure 2. Step-responses of Padé approximationsf Rn-1,n(s) and Rn,n(s).

 

n

In-1,n

In,n

1

0,235759

0,27067

2

0,106261

0,15424

3

0,069044

0,10701

4

0,051133

0,08162

5

0,040512

0,06583

Table 2. Mean-square-errors of step-responses of Rn,n(s) and Rn-1,n(s).

 

CONCLUSIONS

We have considered the general Padé approximation of a dead-time with transfer function e-sT. The polynomials of the rational approximations are given in analytic form. The "standard" Padé approximation Rn,n(s) exhibits a jump at t=0 in its step-response. To avoid this phenomenon we recommend the Padé approximation Rn-1,n(s) where the numerator's degree is one less than that of the denominator. This gives a better approximation of the step-response. Applied in closed-loop, they differ due to their different frequency characteristics. There seems to be a clear compromise between the use of Rn,n(s) or Rn-1,n(s) depending on the frequency range. One has to realize that by approximating a dead-time in control systems, we introduce modeling errors, which consequently limits the achievable bandwidth. Some consequences are discussed in [7, pp.115]. Padé approximations can also be used for model reduction [10].

 

REFERENCES

[1] ERDÉLYI,A. at all.: Higher Transcendental Functions,

McGraw-Hill Book Company, Inc., New York, 1953.

[2] FIKE,C.T.: Computer Evaluation of Mathematical Functions,

Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1868.

[3] FRIEDLY,J.C.: Dynamic Behavior of Processes,

Prentice-Hall,Inc., Englewoods Cliffs, N.J. 1972.

[4] GOLUB,G.H. and Ch.F.van LOAN: Matrix Computations,

Johns Hopkins Universit Press, Baltimore, 1989.

[5] KAMEN,E.W. and B.S.HECK: Fundamentals of Signals and Systems using Matlab,

Prentice-Hall, Inc., Upper Saddle River, New Jersey, 1997.

[6] KUO,B.C.: Automatic Control Systems,

Prentice-Hall,Inc., Englewoods Cliffs, New Jersey, 6th edition, 1991.

[7] MORARI,M. and E.ZAFIRIOU: Robust Process Control,

Prentice-Hall Int. Inc., New York, 1989.

[8] PALM,W.J.III.: Control Systems Engineering,

John Wiley & Sons, Inc., New York, 1986.

[9] PRESS,W.H., B.P.FLANNERY, S.A.TEUKOLSKY and W.T.VETTERLINK: "Padé Approximants"

§5.12 in Numerical Recipes in FORTRAN: The Art of Scientific Computing,

Cambridge University Press, Cambridge, 2nd edition, pp.194-197, 1992.

[10] PURI,N.N. and D.P.LAN: Stable Model Reduction by Impulse Response Error Minimization

Using Michailov Criterion and Pade's Approximation,

Journal of Dynamic Systems, Measurement and Control,

Trans. of ASME, 110, (1988), pp.389-394.

[11] SPIEGEL,M.R.: Mathematical Handbook,

in "Schaum's Outline Series", McGraw-Hill Book Company, New York, 1968.

[12] STEPHANOPOULOS,G.: Chemical Process Control,

Prentice-Hall Int. Inc., New York, 1984.

[13] TUSCHÁK,R.: Control Systems,

(in hungarian), Technical University Press, Budapest, 4th edition, 1998.

[14] VAJTA,M.: On Padé approximations of a dead-time,

Internal Report, Dept. of Mathematical Sciences, University of Twente, 2000.