用二次公式解三次方程
Solving Cubic Equations By the Quadratic Formula
AI总结:
本文证明三次方程至少有一个临界点具有Voronoi性质,并给出该性质的特征化。通过该性质,提出了一种不同于传统方法的求解三次方程的新算法。
摘要:
设p(z)为一个单根的复多项式,具有不同的根和不同的临界点。我们称一个临界点具有Voronoi性质,如果它位于根θ的Voronoi单元V(θ)内,即所有更接近θ而非其他根的点的集合。本文证明至少有一个临界点具有Voronoi性质,并刻画了当两个临界点都满足该性质的情况。已知对于任何ξ∈V(θ),序列B_m(ξ)=ξ-p(ξ)d_{m-2}/d_{m-1}收敛到θ,其中d_m满足递推关系d_m=p'(ξ)d_{m-1}-0.5p(ξ)p''(ξ)d_{m-2}+p^2(ξ)d_{m-3},d_0=1,d_{-1}=d_{-2}=0。因此,通过Voronoi性质,存在一个解c使得p'(z)=0,其中B_m(c)收敛到p(z)的根。收敛速度取决于c到最近和次近根之间的距离比。这导致了一种不同于传统方法的求解三次方程的新算法。我们给出了一个例子的多项式图形。
英文摘要:
Let $p(z)$ be a monic cubic complex polynomial with distinct roots and distinct critical points. We say a critical point has the {\it Voronoi property} if it lies in the Voronoi cell of a root $θ$, $V(θ)$, i.e. the set of points that are closer to $θ$ than to the other roots. We prove at least one critical point has the Voronoi property and characterize the cases when both satisfy this property. It is known that for any $ξ\in V(θ)$, the sequence $B_m(ξ) =ξ- p(ξ) d_{m-2}/d_{m-1}$ converges to $θ$, where $d_m$ satisfies the recurrence $d_m =p'(ξ)d_{m-1}-0.5 p(ξ)p''(ξ)d_{m-2} +p^2(ξ)d_{m-3}$, $d_0 =1, d_{-1}=d_{-2}=0$. Thus by the Voronoi property, there is a solution $c$ of $p'(z)=0$ where $B_m(c)$ converges to a root of $p(z)$. The speed of convergence is dependent on the ratio of the distances between $c$ and the closest and the second closest roots of $p(z)$. This results in a different algorithm for solving a cubic equation than the classical methods. We give polynomiography for an example.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。