residue
Partial fraction expansion (partial fraction decomposition)
Description
[
finds
the residues, poles, and direct term of a Partial Fraction Expansion of the ratio of two polynomials,
where the expansion is of the formr
,p
,k
]
= residue(b
,a
)
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.
Examples
Input Arguments
Output Arguments
More About
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 useresiduez
(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