On an efficient simultaneous method for finding polynomial zeros
From MaRDI portal
Publication:2345285
Recommendations
- On an efficient family of simultaneous methods for finding polynomial multiple zeros
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
- On an efficient method for the simultaneous approximation of polynomial multiple roots
- A highly efficient root-solver of very fast convergence
Cites work
- scientific article; zbMATH DE number 3992817 (Why is no real title available?)
- A modified Newton method for polynomials
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- Circular arithmetic and the determination of polynomial zeros
- Convergence ball and error analysis of the Ostrowski-Traub method
- Families of optimal multipoint methods for solving nonlinear equations: a survey
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Iterative methods for simultaneous inclusion of polynomial zeros
- Modern computer arithmetic
- Multipoint methods for solving nonlinear equations
- Numerical methods for roots of polynomials. Part I
- Optimal Order of One-Point and Multipoint Iteration
- Point estimation of root finding methods
- Some modifications of the parallel Halley iteration method and their convergence
- The fundamental theorem of algebra and complexity theory
- The improved Farmer--Loizou method for finding polynomial zeros
Cited in
(27)- The improved Farmer--Loizou method for finding polynomial zeros
- scientific article; zbMATH DE number 3928211 (Why is no real title available?)
- On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
- An iterative scheme to obtain multiple solutions simultaneously
- scientific article; zbMATH DE number 766833 (Why is no real title available?)
- ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS
- Simultaneous roots for vectorial problems
- ON INVERSE ITERATION PROCESS FOR FINDING ALL ROOTS OF NONLINEAR EQUATIONS WITH APPLICATIONS
- scientific article; zbMATH DE number 714514 (Why is no real title available?)
- A highly efficient root-solver of very fast convergence
- 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
- scientific article; zbMATH DE number 1904879 (Why is no real title available?)
- Efficient iterative methods for finding simultaneously all the multiple roots of polynomial equation
- scientific article; zbMATH DE number 57957 (Why is no real title available?)
- A method for finding zeros of polynomial equations using a contour integral based eigensolver
- On highly efficient derivative-free family of numerical methods for solving polynomial equation simultaneously
- Iterative schemes for finding all roots simultaneously of nonlinear equations
- On an efficient family of simultaneous methods for finding polynomial multiple zeros
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
- scientific article; zbMATH DE number 440790 (Why is no real title available?)
- The self-validated method for polynomial zeros of high efficiency
- On an efficient method for the simultaneous approximation of polynomial multiple roots
- scientific article; zbMATH DE number 2201399 (Why is no real title available?)
- scientific article; zbMATH DE number 4216021 (Why is no real title available?)
- Sorting-based localization and stable computation of zeros of a polynomial. II.
- Computational efficiency of some combined methods for polynomial equations
This page was built for publication: On an efficient simultaneous method for finding polynomial zeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345285)
