Chebyshev-like root-finding methods with accelerated convergence
iterative methodscomputational efficiencypolynomial zerosChebyshev's methodinitial conditionacceleration of convergencecomplex zerosHalley's correctionsGauss-Seidel approachNewton's correctionsimultaneous methodsingle-step methodsmultiple zeroes
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of roots of polynomial equations (65H04)
- scientific article; zbMATH DE number 1868929
- On the convergence of Chebyshev's method for multiple polynomial zeros
- Some generalizations of the Chebyshev method for simultaneous determination of all roots of polynomial equations
- Convergence of Chebyshev-like method for simultaneous approximation of multiple polynomial zeros
- An efficient higher order family of root finders
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A bibliography on roots of polynomials
- A family of root finding methods
- Computational efficiency of some combined methods for polynomial equations
- Iterative methods for simultaneous inclusion of polynomial zeros
- Numerical methods for roots of polynomials. Part I
- On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
- On some simultaneous methods based on Weierstrass' correction
- 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
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- Safe convergence of simultaneous methods for polynomial zeros
- The fundamental theorem of algebra and complexity theory
- Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
- The improved Farmer--Loizou method for finding polynomial zeros
- scientific article; zbMATH DE number 1868929 (Why is no real title available?)
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros
- Convergence acceleration of Gauss-Chebyshev quadrature formulae
- Chebyshev acceleration for SOR-like method
- Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence
- A family of root-finding methods with accelerated convergence
- On a cubically convergent derivative-free root finding method
- Improved Chebyshev-Halley family of methods with seventh and eighth order of convergence for simple roots
- Some generalizations of the Chebyshev method for simultaneous determination of all roots of polynomial equations
- On a high-order one-parameter family for the simultaneous determination of polynomial roots
- On a family of Weierstrass-type root-finding methods with accelerated convergence
- Rapidly convergent modification of the method of chebyshev centers
- Computational efficiency of some combined methods for polynomial equations
- A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class
This page was built for publication: Chebyshev-like root-finding methods with accelerated convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011656)
