求解四元数二次方程的算法与多项式图谱
Algorithms and Polynomiography for Solving Quaternion Quadratic Equations
AI总结:
本文研究四元数二次方程的求解方法,基于Huang和So的公式及Kalman的结果,提出利用牛顿和Halley方法迭代求解,并通过多项式图谱展示收敛速度。
摘要:
求解四元数二次方程$P(x)=ax^2+bx+c=0$的算法与多项式图谱。四元数二次方程的求解并非易事。Huang和So给出了完整的公式,根据系数将问题分为若干情况。第二作者在\cite{kalQ}中的结果表明,$P(x)$的零点可以表示为实四次方程零点的函数。这大大简化了二次方程的求解过程。本文还考虑通过牛顿和Halley方法迭代求解$P(x)=0$,并证明了牛顿和Halley方法的雅可比矩阵的性质,并描述了几种基于这些方法的二维多项式图谱。这些图像不仅编码了迭代过程的结果,通过测量渲染时间,我们还发现了这些方法的相对收敛速度。
英文摘要:
Solving a quadratic equation $P(x)=ax^2+bx+c=0$ with real coefficients is known to middle school students. Solving the equation over the quaternions is not straightforward. Huang and So \cite{Huang} give a complete set of formulas, breaking it into several cases depending on the coefficients. From a result of the second author in \cite{kalQ}, zeros of $P(x)$ can be expressed in terms of the zeros of a real quartic equation. This drastically simplifies solving a quadratic equation. Here we also consider solving $P(x)=0$ iteratively via Newton and Halley methods developed in \cite{kalQ}. We prove a property of the Jacobian of Newton and Halley methods and describe several 2D polynomiography based on these methods. The images not only encode the outcome of the iterative process, but by measuring the time taken to render them we find the relative speed of convergence for the methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。