摘要
考虑非线性方程组: F(x)=0, (1.1)其中F:R^n→R^n是二次连续可微函数.一般地说,解方程组(1.1)的拟Newton法较Newton法更为有效.我们可以将拟Newton法解释为逐次在R^n的子空间上构造F′(x)的近似(割线近似)得到的算法.按照这种思想,如果将子空间依次循环取成F′(x)
In this paper, the computational efficiency of the entry-update Newton-like method forsolving systems of n nonlinear equations is considered. By studying the efficiency index, theoptimal update period of this method is given and is proved to be independent of n in somesense.
出处
《计算数学》
CSCD
北大核心
1991年第2期218-224,共7页
Mathematica Numerica Sinica
基金
国家自然科学基金
