ButterAddict

Contour Integration

Word count: 711Reading time: 4 min
2019/03/29 Share

Contour Integration

Idea: A powerful method of doing integrals by using the properties of complex functions.

Analytic functions

  1. To be differentiable at a point, a function must satisfy Cauchy-Riemann.
  1. To be analytic in a region, exists and is continuous in the region; to be analytic at a point, needs to be analytic in a region around the point.

  2. If analytic, and both satisfy 2D-Laplace equation.

Complex Integrals

To do integration on a complex plane, we need to specify a contour - the result may depend on the contour.

Properties

  1. Contours can add up.

  2. Reverse direction gives negative the result.

  3. By parts and substitution applies.

  4. If a contour has length L, then

Cauchy’s theorem

If a function is analytic in a simply-connected domain , then for any simple closed curve in ,

Proof by Green’s theorem in 2D.

Consequence

Deforming a contour does not change the value of integral, as long as it does not cross a singularity.

If has no singularities anywhere, then integrals does not depend at all on the contours.

Residues

The coefficient in the Laurent expansion is the residue of the pole.

Ways to calculate residues*

  1. Direct expansion

  2. Simple pole:

  3. Pole of order N:

  1. L’Hopital’s rule in conjunction with the above.

  2. If is analytic, residue of is .

  3. If has a simple zero, is analytic, residue of is .

Calculus of residues

Residue theorem: f(z) in a simply connected region is analytic except a finite number of poles at , and a simple closed curve encircles the poles in an anticlockwise direction,

Proof by substitute polar, for a small circle around a pole.

Cauchy’s formula

for analytic . Follows directly from residue theorem.

The point at infinity

The is a single point if considering the stereographic projection of the complex plane onto the Riemann sphere.

To study the behaviour at infinity, define a new variable and study its behaviour at 0.

Multivalued functions and branch cuts

A point that cannot be encircled by a curve where the function is continuous and single-valued is called a branch point.

To make a function continuous and single valued, a branch cut is introduced to prevent any curve from encircling that point.

The cut can be any curve from the branch point to infinity.

In some cases, a finite branch cut may be used to connect two branch points. Check by encircling both points.

Branch cuts do not actually matter for integrals not encircling the branch point for .

Choices of contours

Several standard choices are listed below.

  • When evaluating straight lines not on real axis, carefully parameterise .
  • For keyholes, make sure the and bits both vanishes (or at least converges). - check their big O

Transformation Methods

Jordan’s lemma

If uniformly (order does not depend on angle) on as , then

Fourier transform methods

  1. Reduce the order of an ODE/PDE by doing FT.
  2. In space, express the target function as a product of functions, one of which we know the FT, , the other one we know the original function .
  3. Either
    • realise that in space, the original function is a convolution, so find the anti-FT first. Or;
    • find the FT first and do an inverse transform.

Like this? Please support me!

or via other methods.

Author:2LalA猪

Permalink:https://butteraddict.fun/2019/03/Contour-Integration/

Published on:29th March 2019, 1:20 pm

Updated on:9th June 2020, 3:24 pm

License:CC BY 4.0

Webmentions - no interactions yet...

    CATALOG
    1. 1. Contour Integration
      1. 1.1. Analytic functions
      2. 1.2. Complex Integrals
        1. 1.2.1. Properties
      3. 1.3. Cauchy’s theorem
        1. 1.3.1. Consequence
      4. 1.4. Residues
        1. 1.4.1. Ways to calculate residues*
      5. 1.5. Calculus of residues
      6. 1.6. Cauchy’s formula
      7. 1.7. The point at infinity
      8. 1.8. Multivalued functions and branch cuts
      9. 1.9. Choices of contours
    2. 2. Transformation Methods
      1. 2.1. Jordan’s lemma
      2. 2.2. Fourier transform methods