On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity

DOI10.1016/j.cam.2016.06.008zbMath1346.65022OpenAlexW2444226636MaRDI QIDQ738970

Beny Neta, Ivan Petković

Publication date: 16 August 2016

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2016.06.008

zbMATH Keywords

algorithmnumerical exampleiterative methodscomputer graphicsnonlinear equationssymbolic calculationmultiple zerosmultiple roots of unknown multiplicity

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical computation of solutions to single equations (65H05)

Related Items (8)

On optimal parameter of Laguerre's family of zero-finding methods ⋮ Dynamic study of Schröder's families of first and second kind ⋮ Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials ⋮ On generalized Halley-like methods for solving nonlinear equations ⋮ On a high-order one-parameter family for the simultaneous determination of polynomial roots ⋮ Symbolic computation and computer graphics as tools for developing and studying new root-finding methods ⋮ Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros ⋮ Computer tools for the construction and analysis of some efficient root-finding simultaneous methods

Uses Software

• Mathematica

Cites Work

• Continued fraction real root isolation using the Hong root bound
• Constructing higher-order methods for obtaining the multiple roots of nonlinear equations
• Transformation methods for finding multiple roots of nonlinear equations
• Modified Jarratt method for computing multiple roots
• A new fourth-order iterative method for finding multiple roots of nonlinear equations
• Quality of positive root bounds
• Chebyshev-Halley methods for analytic functions
• New families of nonlinear third-order solvers for finding multiple roots
• Some fourth-order nonlinear solvers with closed formulae for multiple roots
• Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
• A third-order modification of Newton's method for multiple roots
• On rediscovered iteration methods for solving equations
• Computing the zeros of analytic functions
• High-order nonlinear solver for multiple roots
• A non-iterative method for solving non-linear equations
• On an Efficient Family of Simultaneous Methods for Finding Polynomial Multiple Zeros
• A family of multiopoint iterative functions for finding multiple roots of equations
• An algorithm for the total, or partial, factorization of a polynomial
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity