arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2112.04898math.GM
收藏

Newton-Raphson方法的一个收敛条件

A convergence condition for Newton-Raphson method

Hassan Khandani

摘要:

本文研究Newton-Raphson方法的收敛性。对于这种方法,存在一些收敛性结果,这些结果实际上不是很有用,并且仅当该序列的第一项非常接近猜测根\cite{sulimayer}时才保证这种方法的收敛性。Khandani等人介绍了一种新的迭代方法来估计实值函数的根\cite{khandani}。利用这种方法,我们引进了一些简单和易于测试的条件下,牛顿-拉夫森序列收敛到它的猜测根,即使在初始点选择非常远离这个根。更清楚地,对于实值二阶可微函数$f:[a,c]\to \mathbb R$,其中$f^{''}f\ge 0$在$(a,c)$上,其中$c$是$f$在$[a,c]$中的唯一根,对于每个$x_0\in[a,c]$,牛顿-拉夫森序列$f$收敛于$c$,只要$f$在该区间上满足一些其他简单条件。如果将$[a,c]$替换为$[c,b]$,则类似的结果成立。我们的研究将使我们能够准确地预测牛顿-拉夫森序列收敛的地方。

英文摘要:

In this paper we study the convergence of Newton-Raphson method. For this method there exists some convergence results which are practically not very useful and just guarantee the convergence of this method when the first term of this sequence is very close to the guessed root \cite{sulimayer}. Khandani et al. introduced a new iterative method to estimate the roots of real-valued functions \cite{khandani}. Using this method we introduce some simple and easy-to-test conditions under which Newton-Raphson sequence converges to its guessed root even when the initial point is chosen very far from this root. More clearly, for a real-valued second differentiable function $f:[a,c]\to \mathbb R$ with $f^{''}f\ge 0$ on $(a,c)$ where $c$ is the unique root of $f$ in $[a,c]$, the Newton-Raphson sequence $f$ converges to $c$ for each $x_0\in[a,c]$ provided $f$ satisfies some other simple conditions on this interval. A similar result holds if $[a,c]$ be replaced with $[c,b]$. Our study will enable us to predict accurately where Newton-Raphson sequence converges.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑