Our goal is to develop a general procedure for computing the inverse Laplace transform of any rational transfer function. A rational function is a ratio of polynomials. These occur, for example, whenever we derive the transfer function of an LTI system. The basic approach consists of three steps:
Before discussing partial fraction expansion, we review some important properties of polynomials with real coefficients.
Two more important properties:
If a polynomial has real coefficients (all the polynomials we consider will have real coefficients), then complex roots always occur in conjugate pairs. That is, if a+bj is a root, then a−bj is also a root. (Here j is the imaginary unit, satisfying j2=−1).
For roots that occur as conjugate pairs, the corresponding factors combine to form a quadratic with real coefficients:
These quadratics are called irreducible quadratics because they have complex roots and cannot be factored further using real numbers. This leads us to the following alternative factorization.
We have defined a lot of new terms so far! Expand the box below for a summary.
Summary of terminology
For polynomials:
Polynomial: An expression of the form ansn+an−1sn−1+⋯+a1s+a0.
Degree: The highest power of s in a polynomial.
Root: A value of s that makes the polynomial equal to zero. A polynomial of degree n has exactly n roots (counting multiplicities).
Conjugate pairs: Complex roots of polynomials with real coefficients that occur in pairs of the form a+bj and a−bj.
Irreducible quadratic: A quadratic polynomial with complex roots; it cannot be factored further using real numbers.
Factorization: Expressing a polynomial as a product of factors of the form (s−zi), where the zi are real or complex roots.
Multiplicity: The number of times a root appears as a factor in the polynomial.
Real factorization: Expressing a polynomial as a product of linear factors (for real roots) and irreducible quadratic factors (for complex conjugate root pairs).
For rational functions:
Rational function: A ratio of two polynomials.
Pole: A root of the denominator polynomial.
Zero: A root of the numerator polynomial.
Strictly proper: A rational function where the degree of the numerator is strictly less than the degree of the denominator.
Simple/repeated: A pole or zero is simple if it occurs once, and repeated if it occurs multiple times (has multiplicity greater than one).
Consider a rational function of the form (8).
Partial fraction expansion requires the rational function to be strictly proper. If it is not, we can perform polynomial long division to rewrite it as the sum of a polynomial and a strictly proper rational function.
This is an improper rational function because the degree of the numerator (3) is greater than or equal to the degree of the denominator (2). Polynomial long division is similar to numerical long division. We divide the leading term of the numerator by the leading term of the denominator to get the first term of the quotient, and continue until the degree of the remainder is less than the degree of the denominator.
The goal of partial fraction expansion (PFE) is to decompose a proper rational function into a sum of simpler fractions. Each simple fraction will correspond to a term whose inverse Laplace transform we can look up in a table.
Given a strictly proper rational function of the form (8), the first step is to factor the denominator a(s) into its irreducible factors using real-coefficient factorization (Eq. (7)). Each factor contributes a term to the PFE. Here are the details of how each factor type contributes:
The first step in PFE is to write down a general form for the expansion based on the factorization of the denominator. At this stage, we still have unknown variables such as the ai and bi in the table above.
The first step is to factor the denominator. For complicated examples such as this one, it is easiest to use a somthing like MATLAB’s roots command to find the roots numerically.
The factorization contains a repeated linear factor (s+1)2, a distinct linear factor (s+3), and an irreducible quadratic factor (s2+2s+5). Therefore, the general form of the PFE is:
The next step is to solve for the unknown coefficients A,B,C,D,E using one of several methods. We will discuss these methods in the following sections.
One method for finding the unknown coefficients in a PFE is to multiply both sides of the equation by the denominator and then match coefficients of powers of s on both sides. This is also called the method of undetermined coefficients.
This method works for any combination of factors (distinct linear, repeated linear, irreducible quadratic). However, it can lead to large systems of equations that are tedious to solve.
The systematic method works fine for small problems, but can become tedious for larger problems. Consider finding the PFE for Example B, whose general form is given by Eq. (14):
The cover-up method, also called Heaviside’s method, is a shortcut for finding the coefficients in a partial fraction expansion when the denominator factors into distinct linear factors. It allows us to find each coefficient directly without solving a system of equations.
The method is most effective for distinct linear factors. For example, consider a case where the denominator factors as
Now set s=ri on both sides. The right-hand side simplifies to Ai because all other terms contain (s−ri) in the numerator, which becomes zero. We are left with:
This is much faster than the systematic method, which would have required more algebraic manipulation and also solving a system of 3 equations in 3 unknowns.
The cover-up method can always be used to find the coefficients associated with distinct linear factors, so we should use it whenever possible. However, if the expression also contains irreducible quadratic factors or repeated factors, we must resort to other methods to find the remaining coefficients. Two options are:
use the systematic method to solve for the remaining coefficients.
choose specific values of s to create additional equations.
We will illustrate these approaches through examples.
This is the same solution we found earlier using the systematic method alone, but we saved some work by using the cover-up method to find A directly. This allowed us to reduce the size of the system of equations we had to solve.
We can use cover-up to find C since (s+3) is a distinct linear factor. We cannot use cover-up to (s+1) because it is repeated. Multiplying by (s+1) and setting s=−1 will lead to division by zero! However, cover-up will work on the largest power (s+1)2. So we can use cover-up to find B.
We could use the systematic method here and solve a system of 3 equations in 3 unknowns, but this still requires considerable algebra. Instead, we can plug in specific values of s and create additional equations.
This is the same solution we found earlier using the systematic method alone, but we saved a lot of work by using the cover-up method to solve for some of the coefficients directly and by choosing specific values of s to create a smaller system of equations.
A carefully chosen value of s (usually s=0 or s=±1) can often lead to simple equations to solve for unknown coefficients, which can be easier than using the systematic method.
Although the cover-up method is not directly applicable to irreducible quadratic factors, it is still possible to use cover-up by working with complex roots. This method is less common, and not advisable for hand calculation because it involves complex arithmetic, but it is worth knowing about because it is the method MATLAB uses.
The complex cover-up method handles irreducible quadratic factors, but it still cannot be used for repeated factors. In such cases, as before, we must resort to other methods to find the remaining coefficients.
For complicated expressions, the MATLAB residue command can compute the partial fraction expansion numerically:
[r, p, k] = residue(num, den)
where num and den are vectors of polynomial coefficients (in descending powers) for the numerator and denominator, respectively. The outputs are:
r : vector of residues
p : vector of poles (in the same order as the residues)
k : quotient polynomial (non-zero only if improper)
when there are repeated poles, they will be listed multiple times in p, with corresponding residues in r, arranged in increasing powers of the repeated factor.
We can input the numerator and denominator coefficients directly into MATLAB. Note that zero coefficients must be included to account for missing powers!
num = [1, 0, 1, -1];
den = [1, 3, 2];
[r, p, k] = residue(num, den);
Result:
r =
11
-3
p =
-2
-1
k =
1 -3
We therefore have residues at {11,−3} corresponding to poles at {−2,−1}, and a quotient polynomial s−3. The final PFE is therefore:
Note that MATLAB returns complex residues and poles this time. It also returns extra decimals, indicating that these are approximate roots calculated numerically. We have a real pole at −3, complex conjugate poles at −1±2j, and a repeated pole at −1. The residues of the repeated pole are 1 and −2, listed in increasing powers of the repeated factor. The k vector is empty because the original G(s) was strictly proper. The resulting PFE is:
First, we check the degrees of the numerator and denominator. Both are degree 3, so we need to perform polynomial long division. Start by expanding the denominator: