A study of accelerated Newton methods for multiple polynomial roots
From MaRDI portal
Publication:973853
DOI10.1007/s11075-009-9332-xzbMath1197.65047OpenAlexW2059815115MaRDI QIDQ973853
Csaba J. Hegedűs, Aurel Galantai
Publication date: 26 May 2010
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-009-9332-x
convergence accelerationpolynomialsNewton methodmultiplicity estimatesmultiple zerosdegree of logarithmic convexityCrouse-Putt algorithmderivative ratios
Related Items (5)
The rate of multiplicity of the roots of nonlinear equations and its application to iterative methods ⋮ On a numerical technique for finding multiple zeros and its dynamic ⋮ Accurate fourteenth-order methods for solving nonlinear equations ⋮ Iterative methods for ill-conditioned roots ⋮ Always convergent iteration methods for nonlinear equations of Lipschitz functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical methods for roots of polynomials. Part I
- A method for computing a root of a single nonlinear equation, including its multiplicity
- Estimating the multiplicity of a root
- A modification of Newton's method for analytic mappings having multiple zeros
- Indices of convexity and concavity. Application to Halley method
- Improving the order of convergence of iteration functions
- Empirical versus asymptotic rate of convergence of a class of methods for solving a polynomial equation
- Improving the Van de Vel root-finding method
- Relationships between order and efficiency of a class of methods for multiple zeros of polynomials
- Convergence of the Newton process to multiple solutions
- Finding a Multiple Zero by Transformations and Newton-Like Methods
- Phase unwrapping by factorization
- Automatic Selection of Sequence Transformations
- The behavior of a multiplicity independent root-finding scheme in the presence of error
- Principles for Testing Polynomial Zerofinding Programs
- A note on the computation of multiple zeros of polynomials by Newton's method
- The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence
- Computing multiple roots of inexact polynomials
- Algorithm 835
- A root-finding algorithm based on Newton's method
- On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation
This page was built for publication: A study of accelerated Newton methods for multiple polynomial roots
