Abstract
Aberth's method for the iterative finding of polynomial zeros using simultaneous interacting guesses is seen to be the systematic use of Newton's method under Parallel Anticipatory Implicit Deflation (PAID), changing the single polynomial problem into that for a system of rational functions. It offers the prospect of parallel execution, discourages coincident convergences, and subjects all iterates to the same algorithm, without the uneven roundoff error accumulation due to deflation typical in serial iterative methods. Yet it converges slowly to multiple zeros, and consumes far more total computing power than serial methods. Factors hindering convergence include problem symmetry and clustering of iterates, alleviated by asymmetric initial guesses and an immediate updating strategy, as seen through the speedup in the experimental APL program PAIDAX.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
