A family of simultaneous zero-finding methods
type: Item
instance of: scholarly article
title: A family of simultaneous zero-finding methods
zbMATH Open document ID: 0908.65028
DOI: 10.1016/S0898-1221(97)00206-X
publication date: 1998-08-20T00:00:00Z
review text: The authors propose a generally original iterative method to simultaneously calculate all zeros of a polynomial. The method improves on previously known methods accelerating the order of convergence from three to four. It contains, as particular cases, a number of other methods. Numerical examples, run in quadruple precision, illustrate the feasability of the method proposed.
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 26C10
Mathematics Subject Classification ID: 30C15
zbMATH DE Number: 1192639
zbMATH Keywords: zeros of polynomials
zbMATH Keywords: iteration functions
zbMATH Keywords: simultaneous methods
zbMATH Keywords: convergence acceleration
zbMATH Keywords: numerical examples
zbMATH Keywords: iterative method
author: M. S. Petković
author: Snežana Ilić
author: S. B. Tričković
reviewed by: Nikolai L. Vulchanov
MaRDI profile type: Publication
cites work: A family of root finding methods
cites work: Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
cites work: Q4321534
cites work: Q5627593
cites work: A parallel algorithm for simple roots of polynomials
cites work: Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
cites work: On some simultaneous methods based on Weierstrass' correction
cites work: Parallel Laguerre iterations: The complex case
cites work: On some improvements of square root iteration for polynomial complex zeros
cites work: A high-order iterative formula for simultaneous determination of zeros of a polynomial
cites work: Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
cites work: Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
cites work: A modified Newton method for polynomials
cites work: Zur iterativen Auflösung algebraischer Gleichungen
cites work: Iterative methods for simultaneous inclusion of polynomial zeros
cites work: Q4072022
full work available at URL: s0898-1221(97)00206-x
OpenAlex ID: W2043556891
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 1192639