On Euler-like methods for the simultaneous approximation of polynomial zeros

DOI10.1007/BF03167406zbMath0908.65029OpenAlexW4242314457MaRDI QIDQ1128293

Miodrag S. Petković, Slobodan B. Tričković, Đorđe D. Herceg

Publication date: 18 March 1999

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03167406

zbMATH Keywords

numerical exampleparallel computationerror bounditerative methodszeros of a polynomialinterval arithmeticinclusion methodsWeierstrass correctionEuler third-order method

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical computation of solutions to single equations (65H05) Parallel numerical computation (65Y05)

Related Items (17)

Family of simultaneous methods of Hansen--Patrick's type ⋮ On a cubically convergent derivative-free root finding method ⋮ A note on the improved derivative free root-solvers ⋮ On the convergence of the sequences of Gerschgorin-like disks ⋮ A note on some recent methods for solving nonlinear equations ⋮ Euler-Like Method for the Simultaneous Inclusion of Polynomial Zeros with Weierstrass’ Correction ⋮ A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence ⋮ On new higher order families of simultaneous methods for finding polynomial zeros ⋮ A family of root-finding methods with accelerated convergence ⋮ High order Euler-like method for the inclusion of polynomial zeros ⋮ An efficient higher order family of root finders ⋮ Efficient methods for the inclusion of polynomial zeros ⋮ Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros ⋮ The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros ⋮ On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial ⋮ On the convergence of Wang-Zheng's method ⋮ Comments on some recent methods for the simultaneous determination of polynomial zeros

Uses Software

• PASCAL-XSC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculating polynomial zeros on a local memory parallel computer
• Finding the roots of a polynomial on an MIMD multicomputer
• The two list algorithm for the knapsack problem on an FPS T20
• On an iterative method for simultaneous inclusion of polynomial complex zeros
• Parallel Laguerre iterations: The complex case
• An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm)
• Weierstrass formula and zero-finding methods
• On some methods for the simultaneous determination of polynomial zeros
• On some simultaneous methods based on Weierstrass' correction
• On iteration methods without derivatives for the simultaneous determination of polynomial zeros
• Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• Circular arithmetic and the determination of polynomial zeros
• Rigorous Error Bounds for Computer Eigensystems
• A highly parallel algorithm for root extraction
• On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation

This page was built for publication: On Euler-like methods for the simultaneous approximation of polynomial zeros