重新审视格雷厄姆·斯特兰格的『寻找i的混沌搜索』
Revisiting Gilbert Strang's "A Chaotic Search for $i$"
AI总结:
本文扩展了斯特兰格关于牛顿法在f(x)=x²+1上的行为研究,推导出k阶Householder方法及secant方法的公式,并通过实验展示其渐近行为和周期性,同时解释了其他方法的复杂性及如何利用Maple可视化迭代过程。
摘要:
本文扩展了斯特兰格关于牛顿法在f(x)=x²+1上的行为研究,推导出k阶Householder方法及secant方法的公式,并通过实验展示其渐近行为和周期性,同时解释了其他方法的复杂性及如何利用Maple可视化迭代过程。
英文摘要:
In the paper "A Chaotic Search for $i$"~(\cite{strang1991chaotic}), Strang completely explained the behaviour of Newton's method when using real initial guesses on $f(x) = x^{2}+1$, which has only a pair of complex roots $\pm i$. He explored an exact symbolic formula for the iteration, namely $x_{n}=\cot{ \left( 2^{n} θ_{0} \right) }$, which is valid in exact arithmetic. In this paper, we extend this to to $k^{th}$ order Householder methods, which include Halley's method, and to the secant method. Two formulae, $x_{n}=\cot{ \left( θ_{n-1}+θ_{n-2} \right) }$ with $θ_{n-1}=\mathrm{arccot}{\left(x_{n-1}\right)}$ and $θ_{n-2}=\mathrm{arccot}{\left(x_{n-2}\right)}$, and $x_{n}=\cot{ \left( (k+1)^{n} θ_{0} \right) }$ with $θ_{0} = \mathrm{arccot}(x_{0})$, are provided. The asymptotic behaviour and periodic character are illustrated by experimental computation. We show that other methods (Schröder iterations of the first kind) are generally not so simple. We also explain an old method that can be used to allow Maple's \textsl{Fractals[Newton]} package to visualize general one-step iterations by disguising them as Newton iterations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。