scientific article; zbMATH DE number 2047307
The author studies the problem of finding real and simple zeros of a polynomial with real coefficients. An algorithm of global type and programming package are developed. The multi-stage algorithm starts with Knuth's inclusion disk and Graeffe's squaring method for localization of zeros and then combines the Newton method and deflation procedure for obtaining zero estimates. The refinement of the approximations is achieved by the use of some fast simultaneous method, as the Weierstrass' and Ehrlich's method. The implementation of the algorithm is realized in Visual Basic, C++ or Fortran 90. Numerical examples are included. For the entire collection see [Zbl 1011.00025].
- scientific article; zbMATH DE number 1929302
- Locating multiple zeros interactively
- The Evaluation of Integrals and Derivatives by Means of Physically Implied Interpolation Functions with a Finite Limiting Fourier Frequency
- An algorithm for locating all zeros of a real polynomial
- scientific article; zbMATH DE number 2098030
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451500)