摘要
考虑非线性方程的求根问题,将非线性方程问题转化为求函数极值问题.利用无约束优化技术中的牛顿法,对于单根,得到的算法与New-Raphson求根算法等价;对于重根,在不计算二阶导数的情况下,给出了具有二阶收敛速度的求根算法.
This paper concerns the problem of solving nonlinear equations. It is shown that solving nonlinear equations is equivalent to finding out the extremum of function. Applying Newton method of unconstrained optimization technology, the algorithm we have obtained for single root is equivalence to New-Raphson's algorithm;and for multiple roots, the root-extracting algorithm having second-order convergence rate is proposed without calculating 2-order derivatives.
出处
《南京信息工程大学学报(自然科学版)》
CAS
2010年第1期71-73,共3页
Journal of Nanjing University of Information Science & Technology(Natural Science Edition)
基金
国家自然科学基金(60973157)
江苏省高校自然科学基金(08KJB520004)
南京信息工程大学科研基金(JG032006J03)
关键词
优化求根
牛顿法
迭代法
重根
extraction of roots using optimization technology
Newton method
iteration method
multiple root