Multiplicity estimating algorithm for zeros of a complex polynomial and its applications
From MaRDI portal
Publication:1801851
DOI10.1016/0377-0427(93)90032-7zbMath0778.65036OpenAlexW2025973967MaRDI QIDQ1801851
Publication date: 19 December 1993
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(93)90032-7
convergence accelerationDurand-Kerner methodmultiple zerocomplex polynomialDurand-Kerner iterationmultiplicities of the zeros
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deflation algorithm for the multiple roots of a system of nonlinear equations
- Two observations on Durand-Kerner's root-finding method
- Balanced convergence of iterative methods to a multiple zero of a complex polynomial
- Iterative methods for multiple zeros of a polynomial by clustering
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- The Durand-Kerner polynomials roots-finding method in case of multiple roots
- An algorithm for the total, or partial, factorization of a polynomial
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
This page was built for publication: Multiplicity estimating algorithm for zeros of a complex polynomial and its applications
