Computational efficiency of some combined methods for polynomial equations
From MaRDI portal
Publication:2518679
DOI10.1016/J.AMC.2008.08.005zbMATH Open1154.65328OpenAlexW1999383279MaRDI QIDQ2518679FDOQ2518679
Authors: Ivan Petković 
Publication date: 16 January 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2008.08.005
Recommendations
- A highly efficient root-solver of very fast convergence
- On an efficient simultaneous method for finding polynomial zeros
- On an efficient family of simultaneous methods for finding polynomial multiple zeros
- On an efficient method for the simultaneous approximation of polynomial multiple roots
- Chebyshev-like root-finding methods with accelerated convergence
computational efficiencysimultaneous methodspolynomial rootscombined methodsimprovement of convergence
Cites Work
- MPFR
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- A modified Newton method for polynomials
- Some Fourth Order Multipoint Iterative Methods for Solving Equations
- Numerical methods for roots of polynomials. Part I
- Iterative methods for simultaneous inclusion of polynomial zeros
- Title not available (Why is that?)
- A posteriori error bounds for the zeros of polynomials
- Finding the roots of a polynomial on an MIMD multicomputer
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- Calculating polynomial zeros on a local memory parallel computer
Cited In (7)
- On the improved Newton-like methods for the inclusion of polynomial zeros
- 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
- On the efficiency of some combined methods for polynomial complex zeros
- Chebyshev-like root-finding methods with accelerated convergence
- The self-validated method for polynomial zeros of high efficiency
Uses Software
This page was built for publication: Computational efficiency of some combined methods for polynomial equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2518679)
