In the analysis of linear time-invariant systems, we encounter functions that are ratios of two polynomials in a certain variable, say, x. Such functions are known as rational functions. A rational function F(x) can be expressed as
The function F(x) is improper if m ≥ n and proper if m < n. † An improper function can always be separated into the sum of a polynomial in x and a proper function. Consider, for example, the function
F(x)=x2+4x+32x3+9x2+11x+2
Because this is an improper function, we divide the numerator by the denominator until the remainder has a lower degree than the denominator.
† Some sources classify F(x) as strictly proper if m< n, proper if m≤n, and improper if m> n.
26 CHAPTER B BACKGROUND
Therefore, F(x) can be expressed as
F(x)=x2+4x+32x3+9x2+11x+2=polynomial in x2x+1+proper functionx2+4x+3x−1
A proper function can be further expanded into partial fractions. The remaining discussion in this section is concerned with various ways of doing this.
A rational function can be written as a sum of appropriate partial fractions with unknown coefficients, which are determined by clearing fractions and equating the coefficients of similar powers on the two sides. This procedure is demonstrated by the following example.
EXAMPLE B.8 Method of Clearing Fractions
Expand the following rational function F(x) into partial fractions:
F(x)=(x+1)(x+2)(x+3)2x3+3x2+4x+6
This function can be expressed as a sum of partial fractions with denominators (x + 1), (x +2),(x +3), and (x +3)2, as follows:
Equating coefficients of similar powers on both sides yields
k1+k2+k3=1
\n
8k1+7k2+6k3+k4=3
\n
21k1+15k2+11k3+3k4=4
\n
18k1+9k2+6k3+2k4=6
Solution of these four simultaneous equations yields
k1=1
, k2=−2 , k3=2 , k4=−3
Therefore,
F(x)=x+11−x+22+x+32−(x+3)23
Although this method is straightforward and applicable to all situations, it is not necessarily the most efficient. We now discuss other methods that can reduce numerical work considerably.
We shall first consider the partial fraction expansion of F(x) = P(x)/Q(x), in which all the factors of Q(x) are distinct (not repeated). Consider the proper function
To determine k1, we let x = −1 in (x + 1)F(x). Note that (x + 1)F(x) is obtained from F(x) by omitting the term (x + 1) from its denominator. Therefore, to compute k1 corresponding to the factor (x + 1), we cover up the term (x + 1) in the denominator of F(x) and then substitute x = −1 in the remaining expression. [Mentally conceal the term (x + 1) in F(x) with a finger and then let x = −1 in the remaining expression.] The steps in covering up the function
F(x)=(x+1)(x−2)(x+3)2x2+9x−11
are as follows.
Step 1. Cover up (conceal) the factor (x +1) from F(x):
(x+1)(x−2)(x+3)2x2+9x−11
Step 2. Substitute x = −1 in the remaining expression to obtain k1:
k1=(−1−2)(−1+3)2−9−11=−6−18=3
Similarly, to compute k2, we cover up the factor (x − 2) in F(x) and let x = 2 in the remaining function, as follows:
The coefficients k2 and k3 corresponding to the complex-conjugate factors are also conjugates of each other. This is generally true when the coefficients of a rational function are real. In such a case, we need to compute only one of the coefficients.
QUADRATIC FACTORS
Often we are required to combine the two terms arising from complex-conjugate factors into one quadratic factor. For example, F(x) in Eq. (B.25) can be expressed as
The coefficient k1 is found by the Heaviside method to be 2. Therefore,
(x+1)(x2+4x+13)4x2+2x+18=x+12+x2+4x+13c1x+c2
(B.26)
The values of c1 and c2 are determined by clearing fractions and equating the coefficients of similar powers of x on both sides of the resulting equation. Clearing fractions on both sides of Eq. (B.26) yields
4x2+2x+18=2(x2+4x+13)+(c1x+c2)(x+1)
= (2+c1)x2 + (8+c1+c2)x + (26+c2)
Equating terms of similar powers yields c1 = 2, c2 = −8, and
(x+1)(x2+4x+13)4x2+2x+18=x+12+x2+4x+132x−8
SHORTCUTS
The values of c1 and c2 in Eq. (B.26) can also be determined by using shortcuts. After computing k1 = 2 by the Heaviside method as before, we let x = 0 on both sides of Eq. (B.26) to eliminate c1. This gives us
1318=2+13c2⇒c2=−8
To determine c1, we multiply both sides of Eq. (B.26) by x and then let x → ∞. Remember that when x → ∞, only the terms of the highest power are significant. Therefore,
4=2+c1⇒c1=2
In the procedure discussed here, we let x = 0 to determine c2 and then multiply both sides by x and let x → ∞ to determine c1. However, nothing is sacred about these values (x = 0 or x = ∞). We use them because they reduce the number of computations involved. We could just as well use other convenient values for x, such as x = 1. Consider the case
F(x)=x(x2+2x+5)2x2+4x+5=xk+x2+2x+5c1x+c2
We find k = 1 by the Heaviside method in the usual manner. As a result,
x(x2+2x+5)2x2+4x+5=x1+x2+2x+5c1x+c2
(B.27)
If we try letting x = 0 to determine c1 and c2, we obtain ∞ on both sides. So let us choose x = 1. This yields
811=1+8c1+c2orc1+c2=3
We can now choose some other value for x, such as x = 2, to obtain one more relationship to use in determining c1 and c2. In this case, however, a simple method is to multiply both sides of Eq. (B.27) by x and then let x → ∞. This yields
2=1+c1⇒c1=1
Since c1 +c2 = 3, we see that c2 = 2 and therefore,
If a function F(x) has a repeated factor in its denominator, it has the form
F(x)=(x−λ)r(x−α1)(x−α2)⋯(x−αj)P(x)
Its partial fraction expansion is given by
F(x)=(x−λ)ra0+(x−λ)r−1a1+⋯+(x−λ)ar−1
x−α1k1+x−α2k2+⋯+x−αjkj
(B.28)
The coefficients k1, k2,…, kj corresponding to the unrepeated factors in this equation are determined by the Heaviside method, as before [Eq. (B.24)]. To find the coefficients a0,a1, a2,…,ar−1, we multiply both sides of Eq. (B.28) by (x −λ)r . This gives us
If we let x = λ on both sides of Eq. (B.29), we obtain
(x−λ)rF(x)∣x=λ=a0
Therefore, a0 is obtained by concealing the factor (x−λ)r in F(x) and letting x =λ in the remaining expression (the Heaviside “cover-up” method). If we take the derivative (with respect to x) of both sides of Eq. (B.29), the right-hand side is a1+ terms containing a factor (x−λ) in their numerators. Letting x = λ on both sides of this equation, we obtain
dxd[(x−λ)rF(x)]x=λ=a1
Thus, a1 is obtained by concealing the factor (x−λ)r in F(x), taking the derivative of the remaining expression, and then letting x = λ. Continuing in this manner, we find
aj=j!1dxjdj[(x−λ)rF(x)]x=λ
(B.30)
Observe that (x − λ)r F(x) is obtained from F(x) by omitting the factor (x − λ)r from its denominator. Therefore, the coefficient aj is obtained by concealing the factor (x − λ)r in F(x), taking the jth derivative of the remaining expression, and then letting x = λ (while dividing by j!).
EXAMPLE B.10 Partial Fraction Expansion with Repeated Factors
Expand F(x) into partial fractions if
F(x)=(x+1)3(x+2)4x3+16x2+23x+13
The partial fractions are
F(x)=(x+1)3a0+(x+1)2a1+x+1a2+x+2k
The coefficient k is obtained by concealing the factor (x + 2) in F(x) and then substituting x = −2 in the remaining expression:
k=(x+1)3(x+2)4x3+16x2+23x+13x=−2=1
To find a0, we conceal the factor (x +1)3 in F(x) and let x = −1 in the remaining expression:
a0=(x+1)3(x+2)4x3+16x2+23x+13x=−1=2
To find a1, we conceal the factor (x + 1)3 in F(x), take the derivative of the remaining expression, and then let x = −1:
For multiple roots, especially of higher order, the Heaviside expansion method, which requires repeated differentiation, can become cumbersome. For a function that contains several repeated and unrepeated roots, a hybrid of the two procedures proves to be the best. The simpler coefficients are determined by the Heaviside method, and the remaining coefficients are found by clearing fractions or shortcuts, thus incorporating the best of the two methods. We demonstrate this procedure by solving Ex. B.10 once again by this method.
In Ex. B.10, coefficients k and a0 are relatively simple to determine by the Heaviside expansion method. These values were found to be k1 = 1 and a0 = 2. Therefore,
Equating coefficients of the third and second powers of x on both sides, we obtain
1+a2=4a1+4a2+3=16⟹a1=1a2=3
We may stop here if we wish because the two desired coefficients, a1 and a2, are now determined. However, equating the coefficients of the two remaining powers of x yields a convenient check on the answer. Equating the coefficients of the x1 and x0 terms, we obtain
23=5+3a1+5a213=4+2a1+2a2+1
These equations are satisfied by the values a1 = 1 and a2 = 3, found earlier, providing an additional check for our answers. Therefore,
F(x)=(x+1)32+(x+1)21+x+13+x+21
which agrees with the earlier result.
A COMBINATION OF HEAVISIDE “COVER-UP” AND SHORTCUTS
In Ex. B.10, after determining the coefficients a0 = 2 and k = 1 by the Heaviside method as before, we have
There are only two unknown coefficients, a1 and a2. If we multiply both sides of this equation by x and then let x → ∞, we can eliminate a1. This yields
There is now only one unknown a1, which can be readily found by setting x equal to any convenient value, say, x = 0. This yields
213=2+a1+3+21⟹a1=1
which agrees with our earlier answer.
There are other possible shortcuts. For example, we can compute a0 (coefficient of the highest power of the repeated root), subtract this term from both sides, and then repeat the procedure.
A general method of handling an improper function is indicated in the beginning of this section. However, for the special case of when the numerator and denominator polynomials of F(x) have the same degree (m = n), the procedure is the same as that for a proper function. We can show that for
the coefficients k1, k2,…, kn are computed as if F(x) were proper. Thus,
kr=(x−λr)F(x)∣x=λr
For quadratic or repeated factors, the appropriate procedures discussed in Secs. B.5-2 or B.5-3 should be used as if F(x) were proper. In other words, when m = n, the only difference between the proper and improper case is the appearance of an extra constant bn in the latter. Otherwise, the procedure remains the same. The proof is left as an exercise for the reader.
EXAMPLE B.11 Partial Fraction Expansion of Improper Rational Function
In finding the inverse z-transform (Ch. 5), we require partial fractions of the form kx/(x −λi)r rather than k/(x −λi)r . This can be achieved by expanding F(x)/x into partial fractions. Consider, for example,
F(x)=(x+2)(x+3)25x2+20x+18
Dividing both sides by x yields
xF(x)=x(x+2)(x+3)25x2+20x+18
Expansion of the right-hand side into partial fractions as usual yields
An entity specified by n numbers in a certain order (ordered n-tuple) is an n-dimensional vector. Thus, an ordered n-tuple (x1, x2, …, xn) represents an n-dimensional vector x. A vector may be represented as a row (row vector):
x=[x1x2⋯xn]
or as a column (column vector):
x=x1x2⋮xn
Simultaneous linear equations can be viewed as the transformation of one vector into another. Consider, for example, the m simultaneous linear equations
y1=a11x1+a12x2+⋯+a1nxn
\n
y2=a21x1+a22x2+⋯+a2nxn
\n
⋮
\n
ym=am1x1+am2x2+⋯+amnxn
\n(B.31)
If we define two column vectors x and y as
x=x1x2⋮xnandy=y1y2⋮ym
then Eq. (B.31) may be viewed as the relationship or the function that transforms vector x into vector y. Such a transformation is called a linear transformation of vectors. To perform a linear transformation, we need to define the array of coefficients aij appearing in Eq. (B.31). This array is called a matrix and is denoted by A for convenience:
A matrix with m rows and n columns is called a matrix of order (m,n) or an (m × n) matrix. For the special case of m = n, the matrix is called a square matrix of order n.
It should be stressed at this point that a matrix is not a number such as a determinant, but an array of numbers arranged in a particular order. It is convenient to abbreviate the representation of matrix A with the form (aij)m×n, implying a matrix of order m × n with aij as its ijth element. In practice, when the order m × n is understood or need not be specified, the notation can be abbreviated to (aij). Note that the first index i of aij indicates the row and the second index j indicates the column of the element aij in matrix A.
Equation (B.31) may now be expressed in a matrix form as
At this point, we have not defined the multiplication of a matrix by a vector. The quantity Ax is not meaningful until such an operation has been defined.