Please explain the method of steepest descent?

  • Thread starter Thread starter wishfulthinking
  • Start date Start date
  • Tags Tags
    Explain Method
AI Thread Summary
The method of steepest descent, also known as the saddle point method, is used for optimizing functions by following the gradient to find local maxima or minima. It is particularly useful for approximating certain contour integrals. Although resources like Wikipedia provide general information, specific applications may require deeper understanding and context. The discussion highlights a need for step-by-step guidance, especially for those unfamiliar with the method. Further research and clarification on the integral in question are recommended for better comprehension.
wishfulthinking
Messages
5
Reaction score
0
I am not understanding how to use the method of steepest descent aka the saddle point method. Any help would be appreciated, especially step-by-step explanation!
 
Mathematics news on Phys.org
wishfulthinking said:
I am not understanding how to use the method of steepest descent aka the saddle point method. Any help would be appreciated, especially step-by-step explanation!

The method of steepest descent, or gradient descent, is a means of using the gradient of a function to perform an optimization:

http://en.wikipedia.org/wiki/Gradient_descent

You can find many more articles on such a procedure by Googling 'method of steepest descent' or 'method of gradient descent'.
 
Thanks, I did Google the method, but I'm still not quite sure how to use it.
 
wishfulthinking said:
Thanks, I did Google the method, but I'm still not quite sure how to use it.
Well, how familiar are you with using root finding algorithms on single variable equations, like finding the roots of polynomials?

Roughly speaking, steepest descent is an analogous method for functions of two or more variables, where you are trying to find the point at which the function reaches a local maximum or minimum.
 
Thanks for taking the time out to reply. Specifically, I'm being asked to approximate an integral using the method. I've never learned this before and it's not in our textbook. My teacher said to look for outside resources, I'm just not understanding it and was hoping someone could explain it to me.
 
wishfulthinking said:
Thanks for taking the time out to reply. Specifically, I'm being asked to approximate an integral using the method. I've never learned this before and it's not in our textbook. My teacher said to look for outside resources, I'm just not understanding it and was hoping someone could explain it to me.

Well, this technique is used to approximate certain contour integrals, as discussed here:

http://en.wikipedia.org/wiki/Method_of_steepest_descent

Since you know more about the type of integral you are trying to approximate, you're the one best suited to do the research. ;)
 
Suppose ,instead of the usual x,y coordinate system with an I basis vector along the x -axis and a corresponding j basis vector along the y-axis we instead have a different pair of basis vectors ,call them e and f along their respective axes. I have seen that this is an important subject in maths My question is what physical applications does such a model apply to? I am asking here because I have devoted quite a lot of time in the past to understanding convectors and the dual...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Back
Top