In mathematics, the method of steepest descent or saddle-point method is an extension of
Laplace's method
In mathematics, Laplace's method, named after Pierre-Simon Laplace, is a technique used to approximate integrals of the form
:\int_a^b e^ \, dx,
where f is a twice-differentiable function, M is a large number, and the endpoints a and b could b ...
for approximating an integral, where one deforms a contour integral in the complex plane to pass near a stationary point (
saddle point
In mathematics, a saddle point or minimax point is a Point (geometry), point on the surface (mathematics), surface of the graph of a function where the slopes (derivatives) in orthogonal directions are all zero (a Critical point (mathematics), ...
), in roughly the direction of steepest descent or stationary phase. The saddle-point approximation is used with integrals in the complex plane, whereas Laplace’s method is used with real integrals.
The integral to be estimated is often of the form
:
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:
# ''C′'' passes through one or more zeros of the derivative ''g''′(''z''),
# the imaginary part of ''g''(''z'') is constant on ''C′''.
The method of steepest descent was first published by , who used it to estimate
Bessel functions
Bessel functions, named after Friedrich Bessel who was the first to systematically study them in 1824, are canonical solutions of Bessel's differential equation
x^2 \frac + x \frac + \left(x^2 - \alpha^2 \right)y = 0
for an arbitrary complex ...
and pointed out that it occurred in the unpublished note by about
hypergeometric functions
In mathematics, the Gaussian or ordinary hypergeometric function 2''F''1(''a'',''b'';''c'';''z'') is a special function represented by the hypergeometric series, that includes many other special functions as specific or limiting cases. It is ...
. The contour of steepest descent has a minimax property, see . described some other unpublished notes of Riemann, where he used this method to derive the
Riemann–Siegel formula In mathematics, the Riemann–Siegel formula is an asymptotic formula for the error of the approximate functional equation of the Riemann zeta function, an approximation of the zeta function by a sum of two finite Dirichlet series. It was found by ...
.
Basic idea
The method of steepest descent is a method to approximate a complex integral of the form
for large
, where
and
are
analytic function
In mathematics, an analytic function is a function that is locally given by a convergent power series. There exist both real analytic functions and complex analytic functions. Functions of each type are infinitely differentiable, but complex ...
s of
. Because the integrand is analytic, the contour
can be deformed into a new contour
without changing the integral. In particular, one seeks a new contour on which the imaginary part, denoted
, of
,
where are eigenvalues of the
Hessian S''_(x^0) and
(-\mu_j)^ are defined with arguments
This statement is a special case of more general results presented in Fedoryuk (1987).
\int_0^ e^ d\xi = \sqrt (-\mu_j)^.
Equation (8) can also be written as
e^ \left ( \det (-S_''(x^0)) \right )^ \left (f(x^0) + O\left(\lambda^\right) \right),,
where the branch of
:
\sqrt
is selected as follows
:
\begin
\left (\det \left (-S_''(x^0) \right ) \right)^ &= \exp\left( -i \text \left (- S_''(x^0) \right ) \right) \prod_^n \left, \mu_j \^, \\
\text \left (-S_''(x^0) \right) &= \tfrac \sum_^n \arg (-\mu_j), && , \arg(-\mu_j), < \tfrac.
\end
Consider important special cases:
* If is real valued for real and in (aka, the multidimensional Laplace method), then
\text \left(-S_''(x^0) \right ) = 0.
* If is purely imaginary for real (i.e.,
\Re(S(x)) = 0 for all in ) and in (aka, the multidimensional stationary phase method), then
[See equation (2.2.6') on page 186 in ] \text \left (-S_''(x^0) \right ) = \frac \textS_''(x_0), where
\textS_''(x_0) denotes
the signature of matrix S_''(x_0), which equals to the number of negative eigenvalues minus the number of positive ones. It is noteworthy that in applications of the stationary phase method to the multidimensional WKB approximation in quantum mechanics (as well as in optics), is related to the
Maslov index In mathematics, the Lagrangian Grassmannian is the smooth manifold of Lagrangian subspaces of a real symplectic vector space ''V''. Its dimension is ''n''(''n'' + 1) (where the dimension of ''V'' is ''2n''). It may be identified with the homogeneous ...
see, e.g., and .
The case of multiple non-degenerate saddle points
If the function has multiple isolated non-degenerate saddle points, i.e.,
:
\nabla S \left (x^ \right ) = 0, \quad \det S''_ \left (x^ \right ) \neq 0, \quad x^ \in \Omega_x^,
where
:
\left \_^K
is an
open cover
In mathematics, and more particularly in set theory, a cover (or covering) of a set X is a family of subsets of X whose union is all of X. More formally, if C = \lbrace U_\alpha : \alpha \in A \rbrace is an indexed family of subsets U_\alpha\su ...
of , then the calculation of the integral asymptotic is reduced to the case of a single saddle point by employing the
partition of unity
In mathematics, a partition of unity on a topological space is a Set (mathematics), set of continuous function (topology), continuous functions from to the unit interval ,1such that for every point x\in X:
* there is a neighbourhood (mathem ...
. The
partition of unity
In mathematics, a partition of unity on a topological space is a Set (mathematics), set of continuous function (topology), continuous functions from to the unit interval ,1such that for every point x\in X:
* there is a neighbourhood (mathem ...
allows us to construct a set of continuous functions such that
:
\begin
\sum_^K \rho_k(x) &= 1, && \forall x \in \Omega_x, \\
\rho_k(x) &= 0 && \forall x \in \Omega_x\setminus \Omega_x^.
\end
Whence,
:
\int_ f(x) e^ dx \equiv \sum_^K \int_ \rho_k(x) f(x) e^ dx.
Therefore as we have:
:
\sum_^K \int_ f(x) e^ dx = \left(\frac\right)^ \sum_^K e^ \left ( \det \left(-S_'' \left (x^ \right )\right) \right)^ f \left (x^ \right ),
where equation (13) was utilized at the last stage, and the pre-exponential function at least must be continuous.
The other cases
When and
\det S''_(z^0) = 0, the point is called a degenerate saddle point of a function .
Calculating the asymptotic of
:
\int f(x) e^ dx,
when is continuous, and has a degenerate saddle point, is a very rich problem, whose solution heavily relies on the
catastrophe theory
In mathematics, catastrophe theory is a branch of bifurcation theory in the study of dynamical systems; it is also a particular special case of more general singularity theory in geometry.
Bifurcation theory studies and classifies phenomena chara ...
. Here, the catastrophe theory replaces the
Morse lemma, valid only in the non-degenerate case, to transform the function into one of the multitude of canonical representations. For further details see, e.g., and .
Integrals with degenerate saddle points naturally appear in many applications including
optical caustics and the multidimensional
WKB approximation
In mathematical physics, the WKB approximation or WKB method is a technique for finding approximate solutions to Linear differential equation, linear differential equations with spatially varying coefficients. It is typically used for a Semiclass ...
in quantum mechanics.
The other cases such as, e.g., and/or are discontinuous or when an extremum of lies at the integration region's boundary, require special care (see, e.g., and ).
Extensions and generalizations
An extension of the steepest descent method is the so-called ''nonlinear stationary phase/steepest descent method''. Here, instead of integrals, one needs to evaluate asymptotically solutions of
Riemann–Hilbert factorization problems.
Given a contour ''C'' in the
complex sphere
In mathematics, the Riemann sphere, named after Bernhard Riemann,
is a model of the extended complex plane (also called the closed complex plane): the complex plane plus one point at infinity. This extended plane represents the extended complex ...
, a function ''f'' defined on that contour and a special point, say infinity, one seeks a function ''M'' holomorphic away from the contour ''C'', with prescribed jump across ''C'', and with a given normalization at infinity. If ''f'' and hence ''M'' are matrices rather than scalars this is a problem that in general does not admit an explicit solution.
An asymptotic evaluation is then possible along the lines of the linear stationary phase/steepest descent method. The idea is to reduce asymptotically the solution of the given Riemann–Hilbert problem to that of a simpler, explicitly solvable, Riemann–Hilbert problem. Cauchy's theorem is used to justify deformations of the jump contour.
The nonlinear stationary phase was introduced by Deift and Zhou in 1993, based on earlier work of the Russian mathematician Alexander Its. A (properly speaking) nonlinear steepest descent method was introduced by Kamvissis, K. McLaughlin and P. Miller in 2003, based on previous work of Lax, Levermore, Deift, Venakides and Zhou. As in the linear case, steepest descent contours solve a min-max problem. In the nonlinear case they turn out to be "S-curves" (defined in a different context back in the 80s by Stahl, Gonchar and Rakhmanov).
The nonlinear stationary phase/steepest descent method has applications to the theory of
soliton
In mathematics and physics, a soliton is a nonlinear, self-reinforcing, localized wave packet that is , in that it preserves its shape while propagating freely, at constant velocity, and recovers it even after collisions with other such local ...
equations and
integrable model
In mathematics, integrability is a property of certain dynamical systems. While there are several distinct formal definitions, informally speaking, an integrable system is a dynamical system with sufficiently many conserved quantities, or first i ...
s,
random matrices
In probability theory and mathematical physics, a random matrix is a matrix-valued random variable—that is, a matrix in which some or all of its entries are sampled randomly from a probability distribution. Random matrix theory (RMT) is the ...
and
combinatorics
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many ...
.
Another extension is the
Method of Chester–Friedman–Ursell for coalescing saddle points and uniform asymptotic extensions.
See also
*
Pearcey integral
*
Stationary phase approximation
In mathematics, the stationary phase approximation is a basic principle of asymptotic analysis, applying to functions given by integration against a rapidly-varying complex exponential.
This method originates from the 19th century, and is due to G ...
*
Laplace's method
In mathematics, Laplace's method, named after Pierre-Simon Laplace, is a technique used to approximate integrals of the form
:\int_a^b e^ \, dx,
where f is a twice-differentiable function, M is a large number, and the endpoints a and b could b ...
Notes
References
*
* English translation in
*.
*.
*.
*
n Russian
N, or n, is the fourteenth letter of the Latin alphabet, used in the modern English alphabet, the alphabets of other western European languages, and others worldwide. Its name in English is ''en'' (pronounced ), plural ''ens''.
History
...
*.
* (Unpublished note, reproduced in Riemann's collected papers.)
* Reprinted in Gesammelte Abhandlungen, Vol. 1. Berlin: Springer-Verlag, 1966.
**Translated in .
*.
*
*{{Citation
, last1=Wong
, first1=R.
, title=Asymptotic approximations of integrals
, publisher=Academic Press
, year=1989
.
Asymptotic analysis
Perturbation theory