Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
- 1 April 2020
- journal article
- research article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 368
Abstract
No abstract availableKeywords
Funding Information
- Serbian Ministry of Education and Science (174022, 174030)
This publication has 27 references indexed in Scilit:
- On some simultaneous methods based on Weierstrass' correctionJournal of Computational and Applied Mathematics, 1996
- A high-order iterative formula for simultaneous determination of zeros of a polynomialJournal of Computational and Applied Mathematics, 1991
- On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zerosACM Transactions on Mathematical Software, 1986
- A parallel algorithm for simple roots for polynomialsComputers & Mathematics with Applications, 1984
- An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial (An algorithm)Journal of Computational and Applied Mathematics, 1977
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomialInternational Journal of Computer Mathematics, 1977
- Parallel laguerre iterations: The complex caseNumerische Mathematik, 1976
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomialBIT Numerical Mathematics, 1975
- Iteration methods for finding all zeros of a polynomial simultaneouslyMathematics of Computation, 1973
- A modified Newton method for polynomialsCommunications of the ACM, 1967