residue

Partial fraction expansion (partial fraction decomposition)

Syntax

[r,p,k] = residue(b,a)

[b,a] = residue(r,p,k)

Description

[r,p,k] = residue(b,a) finds the residues, poles, and direct term of a Partial Fraction Expansion of the ratio of two polynomials, where the expansion is of the form

$$\frac{b(s)}{a(s)}=\frac{b_m{s}^m+b_{m-1}{s}^{m-1}+\dots +b_{1}s+b_0}{a_n{s}^n+a_{n-1}{s}^{n-1}+\dots +a_{1}s+a_0}=\frac{r_n}{s-p_n}+\mathrm{...}+\frac{r_2}{s-p_2}+\frac{r_1}{s-p_1}+k\left(s\right).$$

The inputs to residue are vectors of coefficients of the polynomials b = [bm ... b1 b0] and a = [an ... a1 a0]. The outputs are the residues r = [rn ... r2 r1], the poles p = [pn ... p2 p1], and the polynomial k. For most textbook problems, k is 0 or a constant.

[b,a] = residue(r,p,k) converts the partial fraction expansion back to the ratio of two polynomials and returns the coefficients in b and a.

Examples

Find Partial Fraction Expansion with Real Roots

Find the partial fraction expansion of the following ratio of polynomials F(s) using residue

$$F(s)=\frac{b(s)}{a(s)}=\frac{-4s+8}{s^2+6s+8}.$$

b = [-4 8];
a = [1 6 8];
[r,p,k] = residue(b,a)

r = 2×1

   -12
     8

p = 2×1

    -4
    -2

k =

     []

This represents the partial fraction expansion

$$\frac{-4s+8}{s^2+6s+8}=\frac{-12}{s+4}+\frac{8}{s+2}.$$

Convert the partial fraction expansion back to polynomial coefficients using residue.

[b,a] = residue(r,p,k)

b = 1×2

    -4     8

a = 1×3

     1     6     8

This result represents the original fraction F(s).

Expansion with Complex Roots and Equal Degree of Numerator and Denominator

If the degree of the numerator is equal to the degree of the denominator, the output k can be nonzero.

Find the partial fraction expansion of a ratio of two polynomials F(s) with complex roots and equal degree of numerator and denominator, where F(s) is

$$F(s)=\frac{b(s)}{a(s)}=\frac{2s^3+s^2}{s^3+s+1}.$$

b = [2 1 0 0];
a = [1 0 1 1];
[r,p,k] = residue(b,a)

r = 3×1 complex

   0.5354 + 1.0390i
   0.5354 - 1.0390i
  -0.0708 + 0.0000i

p = 3×1 complex

   0.3412 + 1.1615i
   0.3412 - 1.1615i
  -0.6823 + 0.0000i

k = 2

residue returns the complex roots and poles, and a constant term in k, representing the partial fraction expansion

$$F(s)=\frac{b(s)}{a(s)}=\frac{2s^3+s^2}{s^3+s+1}=\frac{0.5354+1.0390i}{s-(0.3412+1.1615i)}+\frac{0.5354-1.0390i}{s-(0.3412-1.1615i)}+\frac{-0.0708}{s+0.6823}+2.$$

Expansion with Numerator Degree Greater Than Denominator Degree

When the degree of the numerator is greater than the degree of the denominator, the output k is a vector that represents the coefficients of a polynomial in s.

Perform the following partial fraction expansion of F(s) using residue.

$$F(s)=\frac{b(s)}{a(s)}=\frac{2s^4+s}{s^2+1}=\frac{0.5-1i}{s-1i}+\frac{0.5+1i}{s+1i}+2s^2-2.$$

b = [2 0 0 1 0];
a = [1 0 1];
[r,p,k] = residue(b,a)

r = 2×1 complex

   0.5000 - 1.0000i
   0.5000 + 1.0000i

p = 2×1 complex

   0.0000 + 1.0000i
   0.0000 - 1.0000i

k = 1×3

     2     0    -2

k represents the polynomial $$2s^2-2$$.

Input Arguments

b — Coefficients of numerator polynomial

vector of numbers

Coefficients of the polynomial in the numerator, specified as a vector of numbers representing the coefficients of the polynomial in descending powers of s.

Data Types: single | double
Complex Number Support: Yes

a — Coefficients of denominator polynomial

vector of numbers

Coefficients of the polynomial in the denominator, specified as a vector of numbers representing the coefficients of the polynomial in descending powers of s.

Data Types: single | double
Complex Number Support: Yes

Output Arguments

r — Residues of partial fraction expansion

column vector of numbers

Residues of partial fraction expansion, returned as a column vector of numbers.

p — Poles of partial fraction expansion

column vector of numbers

Poles of partial fraction expansion, returned as a column vector of numbers.

k — Direct term

row vector of numbers

Direct term, returned as a row vector of numbers that specify the coefficients of the polynomial in descending powers of s.

More About

Partial Fraction Expansion

Consider the fraction F(s) of two polynomials b and a of degree n and m (where n and m are positive), respectively

$$F\left(s\right)=\frac{b\left(s\right)}{a\left(s\right)}=\frac{b_n{s}^n+\dots +b_2{s}^2+b_{1}s+b_0}{a_m{s}^m+\dots +a_2{s}^2+a_{1}s+a_0}.$$

The fraction F(s) can be represented as a sum of simple fractions

$$\frac{b(s)}{a(s)}=\frac{r_m}{s-p_m}+\frac{r_{m-1}}{s-p_{m-1}}+\dots +\frac{r_0}{s-p_0}+k(s)$$

This sum is called the partial fraction expansion of F. The values r_m,...,r₁ are the residues, the values p_m,...,p₁ are the poles, and k(s) is a polynomial in s. For most textbook problems, k(s) is 0 or a constant.

The number of poles n is

n = length(a)-1 = length(r) = length(p)

The direct term vector is empty if length(b) < length(a); otherwise

length(k) = length(b)-length(a)+1

If p(j) = ... = p(j+m-1) is a pole of multiplicity m, then the expansion includes terms of the form

$$\frac{r_j}{s-p_j}+\frac{r_{j+1}}{{(s-p_j)}^2}+\dots +\frac{r_{j+m-1}}{{(s-p_j)}^m}.$$

Tips

• residue computes the partial fraction expansion of the ratio of two polynomials in the Laplace domain. To compute partial fraction expansion in the z-domain, you can use residuez (Signal Processing Toolbox).

Algorithms

residue first obtains the poles using roots. Next, if the fraction is nonproper, the direct term k is found using deconv, which performs polynomial long division. Finally, residue determines the residues by evaluating the polynomial with individual roots removed. For repeated roots, resi2 computes the residues at the repeated root locations.

Numerically, the partial fraction expansion of a ratio of polynomials represents an ill-posed problem. If the denominator polynomial, a(s), is near a polynomial with multiple roots, then small changes in the data, including roundoff errors, can result in arbitrarily large changes in the resulting poles and residues. Problem formulations making use of state-space or zero-pole representations are preferable.

References

[1] Oppenheim, A.V. and R.W. Schafer. Digital Signal Processing. Prentice-Hall, 1975, p. 56.

Version History

Introduced before R2006a