Algorithms and Polynomiography for Solving Quaternion Quadratic Equations

MaRDI QIDQ6511577arXivFDO

Authors F. V. Andreev, Bahman Kalantari

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical approximation and computational geometry (primarily algorithms) (65D99) History in mathematics education (97A30)

Abstract: Solving a quadratic equation $P(x)=a{x}^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.

This page was built for publication: Algorithms and Polynomiography for Solving Quaternion Quadratic Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6511577)