On an efficient simultaneous method for finding polynomial zeros
From MaRDI portal
Publication:2345285
DOI10.1016/j.aml.2013.09.011zbMath1311.65046OpenAlexW2015472439MaRDI QIDQ2345285
Jovana Džunić, Miodrag S. Petković, Ljiljana D. Petković
Publication date: 19 May 2015
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2013.09.011
computational efficiencypolynomial zerosacceleration of convergencesimultaneous methodsKung-Traub method
Related Items (7)
ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS ⋮ ON INVERSE ITERATION PROCESS FOR FINDING ALL ROOTS OF NONLINEAR EQUATIONS WITH APPLICATIONS ⋮ On highly efficient derivative-free family of numerical methods for solving polynomial equation simultaneously ⋮ Efficient iterative methods for finding simultaneously all the multiple roots of polynomial equation ⋮ Iterative schemes for finding all roots simultaneously of nonlinear equations ⋮ An iterative scheme to obtain multiple solutions simultaneously ⋮ Simultaneous roots for vectorial problems
Cites Work
- Unnamed Item
- Unnamed Item
- Convergence ball and error analysis of the Ostrowski-Traub method
- Numerical methods for roots of polynomials. Part I
- Point estimation of root finding methods
- Some modifications of the parallel Halley iteration method and their convergence
- Iterative methods for simultaneous inclusion of polynomial zeros
- Circular arithmetic and the determination of polynomial zeros
- Modern Computer Arithmetic
- The fundamental theorem of algebra and complexity theory
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Optimal Order of One-Point and Multipoint Iteration
- The improved Farmer–Loizou method for finding polynomial zeros
- Families of optimal multipoint methods for solving nonlinear equations: A survey
- A modified Newton method for polynomials
This page was built for publication: On an efficient simultaneous method for finding polynomial zeros