On Euler-like methods for the simultaneous approximation of polynomial zeros
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3898097 (Why is no real title available?)
- scientific article; zbMATH DE number 714514 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- A highly parallel algorithm for root extraction
- 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
- Circular arithmetic and the determination of polynomial zeros
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Finding the roots of a polynomial on an MIMD multicomputer
- On an iterative method for simultaneous inclusion of polynomial complex zeros
- On iteration methods without derivatives for the simultaneous determination of polynomial zeros
- On some methods for the simultaneous determination of polynomial zeros
- On some simultaneous methods based on Weierstrass' correction
- On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation
- Parallel Laguerre iterations: The complex case
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- Rigorous Error Bounds for Computer Eigensystems
- The two list algorithm for the knapsack problem on an FPS T20
- Weierstrass formula and zero-finding methods
Cited in
(23)- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
- A note on the improved derivative free root-solvers
- scientific article; zbMATH DE number 1512153 (Why is no real title available?)
- On nonlinear SOR-like methods. I: Applications to simultaneous methods for polynomial zeros
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
- Efficient methods for the inclusion of polynomial zeros
- An efficient higher order family of root finders
- A note on some recent methods for solving nonlinear equations
- Families of high-order simultaneous methods with several corrections
- On new higher order families of simultaneous methods for finding polynomial zeros
- A family of root-finding methods with accelerated convergence
- Comments on some recent methods for the simultaneous determination of polynomial zeros
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
- High order Euler-like method for the inclusion of polynomial zeros
- On the convergence of the sequences of Gerschgorin-like disks
- On the convergence of Wang-Zheng's method
- A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
- On a cubically convergent derivative-free root finding method
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
- The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros
- Family of simultaneous methods of Hansen--Patrick's type
- 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
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)