scipy 1.8.0 Pypi GitHub Homepage
Other Docs
NotesParametersReturnsBackRef
residue(b, a, tol=0.001, rtype='avg')

If :None:None:`M` is the degree of numerator b and :None:None:`N` the degree of denominator a:

        b(s)     b[0] s**(M) + b[1] s**(M-1) + ... + b[M]
H(s) = ------ = ------------------------------------------
        a(s)     a[0] s**(N) + a[1] s**(N-1) + ... + a[N]

then the partial-fraction expansion H(s) is defined as:

    r[0]       r[1]             r[-1]
= -------- + -------- + ... + --------- + k(s)
  (s-p[0])   (s-p[1])         (s-p[-1])

If there are any repeated roots (closer together than :None:None:`tol`), then H(s) has terms like:

  r[i]      r[i+1]              r[i+n-1]
-------- + ----------- + ... + -----------
(s-p[i])  (s-p[i])**2          (s-p[i])**n

This function is used for polynomials in positive powers of s or z, such as analog filters or digital filters in controls engineering. For negative powers of z (typical for digital filters in DSP), use residuez .

See Notes for details about the algorithm.

Notes

The "deflation through subtraction" algorithm is used for computations --- method 6 in .

The form of partial fraction expansion depends on poles multiplicity in the exact mathematical sense. However there is no way to exactly determine multiplicity of roots of a polynomial in numerical computing. Thus you should think of the result of residue with given :None:None:`tol` as partial fraction expansion computed for the denominator composed of the computed poles with empirically determined multiplicity. The choice of :None:None:`tol` can drastically change the result if there are close poles.

Parameters

b : array_like

Numerator polynomial coefficients.

a : array_like

Denominator polynomial coefficients.

tol : float, optional

The tolerance for two roots to be considered equal in terms of the distance between them. Default is 1e-3. See unique_roots for further details.

rtype : {'avg', 'min', 'max'}, optional

Method for computing a root to represent a group of identical roots. Default is 'avg'. See unique_roots for further details.

Returns

r : ndarray

Residues corresponding to the poles. For repeated poles, the residues are ordered to correspond to ascending by power fractions.

p : ndarray

Poles ordered by magnitude in ascending order.

k : ndarray

Coefficients of the direct polynomial term.

Compute partial-fraction expansion of b(s) / a(s).

See Also

invres
numpy.poly
residuez
unique_roots

Examples

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

scipy.signal._signaltools.residuez scipy.signal._signaltools.residue scipy.signal._signaltools.invres

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them


GitHub : /scipy/signal/_signaltools.py#2608
type: <class 'function'>
Commit: