Saddle point approximation

from Wikipedia, the free encyclopedia

In calculus , the saddle point approximation is used to calculate integrals of the form

to calculate approximately. The method comes from Pierre Simon de Laplace (1774) and is sometimes named after him. It is part of the asymptotic analysis .

If the function is analytical and has a global minimum at , we get:

With

.

The second derivative is positive because there is a minimum here. The result is asymptotical, that is, towards infinity .

There can also be finite integration limits.

The generalization of the saddle point approximation into the complex number plane is also called the saddle point method . This explains the naming after a saddle point .

Alternative formulation

Another sign can also be considered in the exponent:

With a different sign applies to

if there is a global maximum asymptotically:

with .

Since there is a maximum here, the second derivative is negative.

Reason

The first case (minimum at ) is considered, the argumentation in the second case is analogous.

For large , the exponential function becomes arbitrarily small outside the vicinity of . Therefore um is expanded into a Taylor series :

.

(Because of the global minimum at is )


Inserting into the integral delivers

.

The size is therefore the limit value of the product and the non- elementary integral. The latter is closely related to the Gaussian error integral or the Gaussian distribution . The integral is of the form , where holds. It is especially because the minimum in the case of a positive second derivative, which will be important in the following:


For everyone with the following relation (e.g. via substitution ) can be shown:

Furthermore, a shift of by the constant does not affect the value of , since the integral can easily be converted into the above integral through the linear substitution with , the value of which is already known.


So you get with :


Thus it follows for (asymptotically):

Applications

The saddle point approximation and saddle point methods find various applications in theoretical physics, including in statistical physics in the limiting case of large systems, in quantum field theory when evaluating path integrals or in optics.

One application is the Stirling formula

for big .

From the definition of the gamma function it follows

With the variable transformation (so that : :) we get:

Now you can use the saddle point approximation in the second form (for maxima) with

with the derivatives

The maximum of f is with the value of the second derivative −1. With the saddle point approximation one obtains:

generalization

The approach to the saddle point is generalized when considering the complex in the method of steepest descent (English: Method of steepest descent) or the method of the stationary phase (English: Method of stationary phase) (general saddle point method). The aim is the asymptotic evaluation of closed path integrals in the complex number plane ( )

for big real ones . In this case, it deformed in the complex the integration path so that a stationary point (zero of the first derivative of g) of lying on the path of integration and then proceeds similar to above (with the additional application of the Cauchy's theorem ). In the version of the steepest descent method, the integration path is placed in such a way that the real part u of g has a maximum there. Since the real part of u g a harmonic function is able to and did not have the same sign: there exists a saddle point and its commitment to integration path along the path of the "steepest descent". Hence the name of the method.

The stationary phase method specifically considers integrals for which the exponent of the exponential function is imaginary along the path:

With a real function u and a large .

The method was first published by Peter Debye in 1909 to estimate Bessel functions , but was also used by Bernhard Riemann .

literature

Web links

Individual evidence

  1. Saddle point method . In: Guido Walz (Ed.): Lexicon of Mathematics . 1st edition. Spectrum Academic Publishing House, Mannheim / Heidelberg 2000, ISBN 3-8274-0439-8 .