Solving Cubic Equations By the Quadratic Formula

preprint2014arXivOpen access

Abstract

Let p(z)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(θ)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 ξ∈V(θ)ξ\in V(θ), the sequence Bm(ξ)=ξ−p(ξ)dm−2/dm−1B_m(ξ) =ξ- p(ξ) d_{m-2}/d_{m-1} converges to θθ, where dmd_m satisfies the recurrence dm=p′(ξ)dm−1−0.5p(ξ)p′′(ξ)dm−2+p2(ξ)dm−3d_m =p'(ξ)d_{m-1}-0.5 p(ξ)p''(ξ)d_{m-2} +p^2(ξ)d_{m-3}, d0=1,d−1=d−2=0d_0 =1, d_{-1}=d_{-2}=0. Thus by the Voronoi property, there is a solution cc of p′(z)=0p'(z)=0 where Bm(c)B_m(c) converges to a root of p(z)p(z). The speed of convergence is dependent on the ratio of the distances between cc and the closest and the second closest roots of p(z)p(z). This results in a different algorithm for solving a cubic equation than the classical methods. We give polynomiography for an example.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.