A family of simultaneous zero-finding methods

DOI10.1016/S0898-1221(97)00206-XzbMath0908.65028OpenAlexW2043556891MaRDI QIDQ1130393

Slobodan B. Tričković, Snežana Ilić, Miodrag S. Petković

Publication date: 20 August 1998

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(97)00206-x

zbMATH Keywords

numerical examplesconvergence accelerationzeros of polynomialsiterative methodsimultaneous methodsiteration functions

Mathematics Subject Classification ID

Related Items (17)

Family of simultaneous methods of Hansen--Patrick's type ⋮ On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros ⋮ On a cubically convergent derivative-free root finding method ⋮ A posteriori error bound methods for the inclusion of polynomial zeros ⋮ On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros ⋮ Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros ⋮ Construction of zero-finding methods by Weierstrass functions ⋮ Simultaneous roots for vectorial problems ⋮ Recursive algorithm without extra function evaluations for the Jacobian matrix of Viéta's polynomial system with applications ⋮ Point estimation of simultaneous methods for solving polynomial equations: A survey ⋮ Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros ⋮ Point estimation of a family of simultaneous zero-finding methods ⋮ On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial ⋮ An effective implementation of a modified Laguerre method for the roots of a polynomial ⋮ The polynomial pivots as initial values for a new root-finding iterative method ⋮ On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem ⋮ A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some improvements of square root iteration for polynomial complex zeros
• A parallel algorithm for simple roots of polynomials
• A high-order iterative formula for simultaneous determination of zeros of a polynomial
• Parallel Laguerre iterations: The complex case
• A family of root finding methods
• Iterative methods for simultaneous inclusion of polynomial zeros
• On some simultaneous methods based on Weierstrass' correction
• Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• Zur iterativen Auflösung algebraischer Gleichungen
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• A modified Newton method for polynomials

This page was built for publication: A family of simultaneous zero-finding methods