Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials

DOI10.1016/j.cam.2017.07.001zbMath1372.65142OpenAlexW2735465290MaRDI QIDQ2402410

Miodrag S. Petković, Ljiljana D. Petković

Publication date: 7 September 2017

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.2017.07.001

zbMATH Keywords

convergencenumerical exampleiterative processpolynomial zerossimultaneous methodsmultiple zerosTraub-Gander's family

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Related Items (1)

Computer visualization and dynamic study of new families of root-solvers

Uses Software

• na20

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iteration functions re-visited
• On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity
• Numerical methods for roots of polynomials. Part I
• Point estimation of root finding methods
• Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
• Locating multiple zeros interactively
• Parallel square-root iterations for multiple roots
• Multiple root-finding methods
• A family of root finding methods
• A method for finding the zeros of polynomials using a companion matrix.
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
• Iterative methods for multiple zeros of a polynomial by clustering
• Computing the zeros of analytic functions
• Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• The Durand-Kerner polynomials roots-finding method in case of multiple roots
• A Modified Bairstow Method for Multiple Zeros of a Polynomial
• Higher-order iteration functions for simultaneously approximating polynomial zeros
• On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
• An algorithm for the total, or partial, factorization of a polynomial
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• A modified Newton method for polynomials
• A note on \(Q\)-order of convergence

This page was built for publication: Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials