A root-finding algorithm for cubics
From MaRDI portal
Recommendations
Cites work
Cited in
(16)- The cubic algorithm
- Locating three-dimensional roots by a bisection method
- The fast cubic algorithm
- Newton-Raphson method, scaling at fractal boundaries and Mathematica
- On general convergence in extracting radicals via a fundamental family of iteration functions
- The calculation of cubic roots after Héron
- The integer cubic algorithm
- scientific article; zbMATH DE number 3846748 (Why is no real title available?)
- The Catalan numbers in the approximation of roots of quadratic polynomials
- scientific article; zbMATH DE number 1286650 (Why is no real title available?)
- McMullen’s root-finding algorithm for cubic polynomials
- An efficient algorithm for computing the roots of general quadratic, cubic and quartic equations
- Some Observations on Khovanskii's Matrix Methods for extracting Roots of Polynomials
- A Uniform Method of Solving Cubics and Quartics
- Dynamics of Newton-like root finding methods
- Solving cubics by polynomial fitting
This page was built for publication: A root-finding algorithm for cubics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4908279)