摘要
This paper discusses a class of discretized Newton methods for solving systems of nonlinear equations. The number of function evaluations requred by the new discretized algorithm is about half of the classical discretized Newton method as Brown and Brent methods. The approximation given by the algorithms to F’(x) is strongly consistent. The algorithms can reduce to the Newton method when the difference stepsize h approaches to zeros but Brown and Brent methods can’t do it. Numerical results show the algorithms are efficient.
This paper discusses a class of discretized Newton methods for solving systems of nonlinear equations. The number of function evaluations requred by the new discretized algorithm is about half of the classical discretized Newton method as Brown and Brent methods. The approximation given by the algorithms to F'(x) is strongly consistent. The algorithms can reduce to the Newton method when the difference stepsize h approaches to zeros but Brown and Brent methods can't do it. Numerical results show the algorithms are efficient.
出处
《计算数学》
CSCD
北大核心
1998年第1期57-68,共12页
Mathematica Numerica Sinica
基金
国家自然科学基金
北京市自然科学基金