A study of accelerated Newton methods for multiple polynomial roots

DOI10.1007/S11075-009-9332-XzbMATH Open1197.65047OpenAlexW2059815115MaRDI QIDQ973853FDOQ973853

Authors: Csaba J. Hegedűs, Aurél Galántai

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

Recommendations

On an efficient method for the simultaneous approximation of polynomial multiple roots
On Newton-type methods for multiple roots with cubic convergence
A new approach to study the dynamics of the modified Newton's method to multiple roots
scientific article; zbMATH DE number 3874500
Numerical impluimentation of a new algorithm for polynomials with multiple roots
scientific article; zbMATH DE number 3928208
Polynomiography based on the nonstandard Newton-like root finding methods
Accelerated Solution of Multivariate Polynomial Systems of Equations
On the modified Newton's method for multiple root
Accelerated approximation of the complex roots of a univariate polynomial

convergence acceleration Newton method polynomials multiplicity estimates multiple zeros degree of logarithmic convexity Crouse-Putt algorithm derivative ratios

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Cites Work

Algorithm 835
Title not available (Why is that?)
Numerical methods for roots of polynomials. Part I
Title not available (Why is that?)
Title not available (Why is that?)
Convergence of the Newton process to multiple solutions
Computing multiple roots of inexact polynomials
A root-finding algorithm based on Newton's method
Indices of convexity and concavity. Application to Halley method
Phase unwrapping by factorization
On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation
A modification of Newton's method for analytic mappings having multiple zeros
The behavior of a multiplicity independent root-finding scheme in the presence of error
Automatic Selection of Sequence Transformations
Title not available (Why is that?)
Principles for Testing Polynomial Zerofinding Programs
Finding a Multiple Zero by Transformations and Newton-Like Methods
Improving the order of convergence of iteration functions
Improving the Van de Vel root-finding method
A method for computing a root of a single nonlinear equation, including its multiplicity
Estimating the multiplicity of a root
Empirical versus asymptotic rate of convergence of a class of methods for solving a polynomial equation
Relationships between order and efficiency of a class of methods for multiple zeros of polynomials
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

Cited In (8)

On a numerical technique for finding multiple zeros and its dynamic
Removing multiplicities in \(\mathbb C\) by double Newtonization
Iterative methods for ill-conditioned roots
Quadratic Newton iteration for systems with multiplicity
The rate of multiplicity of the roots of nonlinear equations and its application to iterative methods
Always convergent iteration methods for nonlinear equations of Lipschitz functions
A combined method for polynomial roots using modified Newton-Raphson with minimum searching
Accurate fourteenth-order methods for solving nonlinear equations

Uses Software

MultRoot

This page was built for publication: A study of accelerated Newton methods for multiple polynomial roots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973853)