PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: Very high
[parent] technique for computing residues (Theorem)

The following two facts are quite useful for computing residues:

If $f$ has a pole of order at most $n+1$ at $x$ , then $$ \operatorname{Res}(f;x) = \lim\limits_{y \to x} {1 \over n!} {d^n \over dy^n} \left( (y-x)^{n+1} f(y) \right) $$

If $g$ is regular at $x$ and $f$ has a simple pole at $x$ , then $\operatorname{Res}(fg;x) = g(x) \operatorname{Res}(f;x)$ .




"technique for computing residues" is owned by rspuzio.
(view preamble | get metadata)

View style:

See Also: coefficients of Laurent series, residues of tangent and cotangent


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: simple pole, regular, order, pole, residues

This is version 4 of technique for computing residues, born on 2006-10-21, modified 2006-10-21.
Object id is 8467, canonical name is TechniqueForComputingResidues.
Accessed 1569 times total.

Classification:
AMS MSC30D30 (Functions of a complex variable :: Entire and meromorphic functions, and related topics :: Meromorphic functions, general theory)

Pending Errata and Addenda
None.
[ View all 3 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)