Why Steepest Descents?
From MaRDI portal
Publication:5624574
DOI10.1137/1012044zbMath0219.65053OpenAlexW2090198173MaRDI QIDQ5624574
Publication date: 1970
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1012044
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Mathematical programming (90C99)
Related Items (9)
A numerical evaluation of integrals by the method of steepest descents ⋮ Mean-field tricritical polymers ⋮ Revisiting the saddle-point method of Perron ⋮ Global solutions of certain fourth order differential equations ⋮ In memoriam Frank W. J. Olver (1924–2013) ⋮ A systematization of the saddle point method. Application to the Airy and Hankel functions ⋮ An extension of Laplace's method ⋮ Error bounds and exponential improvements for the asymptotic expansions of the gamma function and its reciprocal ⋮ Uniform asymptotics for orthogonal polynomials via the Riemann--Hilbert approach
This page was built for publication: Why Steepest Descents?