Find path along steepest gradient in an array
9 visualizaciones (últimos 30 días)
Mostrar comentarios más antiguos
I want to find the path along the steepest gradient in an array of data points. I started using the 'diff function' and the 'for loop' to get information about the maximum difference between two data points. I got stuck. Would be great if someone know how to do that. Attached is the data file.
4 comentarios
Jan
el 23 de Ag. de 2017
Editada: Jan
el 23 de Ag. de 2017
Do you want to consider the 4 surrounding points, or the 8 points including the diagonally neighboring elements?
If the matrix is a real measurment, the method of the steepest descent will probably end in a local maximum cause by noise. It is not really useful to create a simple code, which checks the values of the direct neighbors only, but fitting the local neighborhood by a polynomial and a line-search algorithm might be more stable.
Respuestas (1)
John D'Errico
el 23 de Ag. de 2017
Editada: John D'Errico
el 23 de Ag. de 2017
You have what appears to be a complete surface, a noisy one, but still.
Why cannot you just use a tool like gradient to compute gradients at any point. Then use quiver to show the lines of steepest descent? Effectively, the direction of steepest descent at any point is simply the negative gradient. That also gives you local magnitude of the gradient, so the length of the vector will show the size of the local descent.
Since it seems a bit noisy, you might wish to smooth the surface first a bit. There are many smoothing tools available.
0 comentarios
Ver también
Categorías
Más información sobre Linear Algebra en Help Center y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!