On Euler-like methods for the simultaneous approximation of polynomial zeros
From MaRDI portal
Publication:1128293
DOI10.1007/BF03167406zbMath0908.65029MaRDI 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)
numerical example; parallel computation; error bound; iterative methods; zeros of a polynomial; interval arithmetic; inclusion methods; Weierstrass correction; Euler third-order method
65G30: Interval and finite arithmetic
65H05: Numerical computation of solutions to single equations
65Y05: Parallel numerical computation
Related Items
On a cubically convergent derivative-free root finding method, Efficient methods for the inclusion of polynomial zeros, On the convergence of the sequences of Gerschgorin-like disks, A note on some recent methods for solving nonlinear equations, On new higher order families of simultaneous methods for finding 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, The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros, Comments on some recent methods for the simultaneous determination of polynomial zeros, Family of simultaneous methods of Hansen--Patrick's type, A note on the improved derivative free root-solvers, 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
Uses Software
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