| G. Engeln-Mullges, F. Uhlig. Numerical Algorithms with C. Springer, 1996 |
....search would converge on the critical points, in practice one finds that it sometimes converges to very small regions that do not contain a critical point. Rather than implement a cumbersome vector multidimensional Newton s method, one can implement a simpler non interval 3 D Newton s method [Engeln Mullges Uhlig, 1996] to refine isolated critical points. The method uses the gradient and Hessian to solve V #x #i# ##x #i# = rf#x #i# # (28) for the unknown #x #i# : It adds this increment to the current guess at the critical point to produce a new guess at the critical point x #i 1# = x #i# #x #i# : 29) This ....
EngelnMullges, G. and Uhlig, F. Numerical Algorithms with C. Springer-Verlag, Berlin, 1996.
....on the critical points, in practice one #nds that it sometimes converges to very small regions that do not contain a critical point. Rather than implement a cumbersome multidimensional interval Newton s method, one can implement a simpler non interval 3 D Newton s method #Engeln Mullges Uhlig, 1996# to re#ne isolated critical points. The method uses the gradient and Hessian to solve V #x #i# ##x #i# = rf#x #i# # #28# for the unknown #x #i# : It adds this increment to the current guess at the critical point to produce a new guess at the critical point x #i 1# = x #i# #x #i# : #29# This ....
Uhlig, F. Numerical Algorithms with C. SpringerVerlag, Berlin, 1996.
No context found.
G. Engeln-Mullges, F. Uhlig. Numerical Algorithms with C. Springer, 1996
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC