On Euler-like methods for the simultaneous approximation of polynomial zeros
DOI10.1007/BF03167406zbMATH Open0908.65029OpenAlexW4242314457MaRDI QIDQ1128293FDOQ1128293
Authors: M. S. Petković, S. B. Tričković, Djordje 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
Recommendations
- Euler-like method for the simultaneous inclusion of polynomial zeros with Weierstrass' correction
- The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros
- Publication:4505792
- High order Euler-like method for the inclusion of polynomial zeros
- On some simultaneous methods based on Weierstrass' correction
error bounditerative methodsnumerical exampleparallel computationinterval arithmeticinclusion methodszeros of a polynomialWeierstrass correctionEuler third-order method
Parallel numerical computation (65Y05) Numerical computation of solutions to single equations (65H05) Interval and finite arithmetic (65G30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- Title not available (Why is that?)
- On iteration methods without derivatives for the simultaneous determination of polynomial zeros
- Parallel Laguerre iterations: The complex case
- Circular arithmetic and the determination of polynomial zeros
- Title not available (Why is that?)
- On some methods for the simultaneous determination of polynomial zeros
- Weierstrass formula and zero-finding methods
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Finding the roots of a polynomial on an MIMD multicomputer
- On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation
- An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm)
- Calculating polynomial zeros on a local memory parallel computer
- On some simultaneous methods based on Weierstrass' correction
- Rigorous Error Bounds for Computer Eigensystems
- On an iterative method for simultaneous inclusion of polynomial complex zeros
- The two list algorithm for the knapsack problem on an FPS T20
- Title not available (Why is that?)
- Title not available (Why is that?)
- A highly parallel algorithm for root extraction
Cited In (23)
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
- Comments on some recent methods for the simultaneous determination of polynomial zeros
- On the convergence of the sequences of Gerschgorin-like disks
- Efficient methods for the inclusion of polynomial zeros
- A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence
- A note on some recent methods for solving nonlinear equations
- A family of root-finding methods with accelerated convergence
- On a cubically convergent derivative-free root finding method
- On the convergence of Wang-Zheng's method
- On nonlinear SOR-like methods. I: Applications to simultaneous methods for polynomial zeros
- A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
- Families of high-order simultaneous methods with several corrections
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
- 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 new higher order families of simultaneous methods for finding polynomial zeros
- A note on the improved derivative free root-solvers
- High order Euler-like method for the inclusion of polynomial zeros
- Title not available (Why is that?)
- Family of simultaneous methods of Hansen--Patrick's type
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
- An efficient higher order family of root finders
- Euler-like method for the simultaneous inclusion of polynomial zeros with Weierstrass' correction
Uses Software
This page was built for publication: On Euler-like methods for the simultaneous approximation of polynomial zeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1128293)
