Chebyshev-like root-finding methods with accelerated convergence
DOI10.1002/nla.661zbMath1224.65125OpenAlexW2078573235MaRDI QIDQ3011656
Miodrag S. Petković, Snežana Ilić, Lidija Z. Rančić, Ljiljana D. Petković
Publication date: 29 June 2011
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.661
iterative methodscomputational efficiencypolynomial zerosinitial conditioncomplex zerosacceleration of convergenceChebyshev's methodHalley's correctionsGauss-Seidel approachsimultaneous methodNewton's correctionsingle-step methodsmultiple zeroes
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of roots of polynomial equations (65H04)
Related Items (3)
Cites Work
- Unnamed Item
- Numerical methods for roots of polynomials. Part I
- A family of root finding methods
- Safe convergence of simultaneous methods for polynomial zeros
- A bibliography on roots of polynomials
- Iterative methods for simultaneous inclusion of polynomial zeros
- On some simultaneous methods based on Weierstrass' correction
- On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- Computational efficiency of some combined methods for polynomial equations
- The fundamental theorem of algebra and complexity theory
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- Point estimation of simultaneous methods for solving polynomial equations: A survey
This page was built for publication: Chebyshev-like root-finding methods with accelerated convergence