Lably
Skip to content

Method of steepest descent

  • 9 min read
  • 7 chapters

Related on Lably

Through Mathematical induction, Chain rule and Combinatorics

The integral to be estimated is often of the form

∫Cf(z)eλg(z)dz,

where C is a contour, and λ is large. One version of the method of steepest descent deforms the contour of integration C into a new path integration C′ so that the following conditions hold:

  1. C′ passes through one or more zeros of the derivative g′(z),
  2. the imaginary part of g(z) is constant on C′.

The method of steepest descent was first published by Debye (1909), who used it to estimate Bessel functions and pointed out that it occurred in the unpublished note by Riemann (1863) about hypergeometric functions. The contour of steepest descent has a minimax property, see Fedoryuk (2001). Siegel (1932) described some other unpublished notes of Riemann, where he used this method to derive the Riemann–Siegel formula.

Basic idea

The method of steepest descent is a method to approximate a complex integral of the formI(λ)=∫Cf(z)eλg(z)dzfor large λ→∞, where f(z) and g(z) are analytic functions of z. Because the integrand is analytic, the contour C can be deformed into a new contour C′ without changing the integral. In particular, one seeks a new contour on which the imaginary part, denoted ℑ(⋅), of g(z)=ℜ[g(z)]+iℑ[g(z)] is constant (ℜ(⋅) denotes the real part). Then I(λ)=eiλℑ{g(z)}∫C′f(z)eλℜ{g(z)}dz,and the remaining integral can be approximated with other methods like Laplace's method.

Sign in to keep reading

6 more chapters are free with a Lably account.

More in Applied mathematics