Algorithm 954

DOI10.1145/2699468zbMath1347.65093OpenAlexW2014979769WikidataQ113310262 ScholiaQ113310262MaRDI QIDQ2828160

Norbert Flocke

Publication date: 24 October 2016

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2699468

zbMATH Keywords

Newton-Raphson schemecubic equationpolynomial rootsquartic equation

Mathematics Subject Classification ID

Packaged methods for numerical algorithms (65Y15) Numerical computation of roots of polynomial equations (65H04)

Related Items

Semi-analytical minimum time solutions with velocity constraints for trajectory following of vehicles, Provably convergent Newton-Raphson methods for recovering primitive variables with applications to physical-constraint-preserving Hermite WENO schemes for relativistic hydrodynamics, SPINSGA: A program package for the evaluation of properties of spin-1/2 Heisenberg systems using the symmetric group approach

Uses Software

• Mathematica
• Algorithm 954
• Algorithm 908
• Algorithm 493

Cites Work

• Solving cubics by polynomial fitting
• Algorithms for accurate, validated and fast polynomial evaluation
• The fast quartic solver
• A bibliography on roots of polynomials
• An updated supplementary bibliography on roots of polynomials
• Algorithm 908
• Algorithm 493: Zeros of a Real Polynomial [C2]
• Practical Problems Arising in the Solution of Polynomial Equations
• Extension of Bairstow's Method for Multiple Quadratic Factors
• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item