Images of the applet application of the coordinate descent-ascent algorithm for computing stationary points of a numerical function f(x,y) in the case of finding a saddle points
[size=85]These Images were obtained using the [url=https://www.geogebra.org/m/djykrvyv]applet[/url].[/size]
The position of the starting point and the resulting point of the iterative process for finding the saddle point
[size=85][b][sup]*[/sup]Position of the starting point [color=#00ff00]E[/color] of the iterative process of finding the saddle point.[br][br][b][b][size=85][color=#cc4125]Closest Point[/color], a point of a previously performed approximate solution.[/size][/b][/b][/b][/size]
[b][sup][/sup][size=85][sup]*[/sup]Position of the resulting point [color=#ff00ff]R[sup]*[/sup][/color]of the iterative process of finding the saddle point.[/size][/b]
Before and After iterative process
[b][size=85][color=#cc4125]Closest Point[/color], a point of a previously performed approximate solution.[/size][/b]
Tables Before and After the Iterative Process
Comparison of the diffraction field intensities before and after the iterative process with the Closest Point intensity for a point of a previously performed approximate.
[size=85][b][color=#ff00ff]R[sup]*[/sup][/color] -The position of the resulting point of the iterative process for finding the saddle point.[/b][/size][b][color=#ff00ff][sup][/sup][/color][/b]