Two global convergence strategies of changing step are given to combined with G-N method that can perform the virtue of insensitiveness to initial guess in iteration algorithm.
英
美
- 给出了两种变步长全局收敛策略,与高斯-牛顿法相结合可得到对初值不敏感的迭代算法。