On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity
From MaRDI portal
Publication:1697274
DOI10.1007/s10092-017-0225-4zbMath1384.65029OpenAlexW2610390111MaRDI QIDQ1697274
Veselina K. Kyncheva, Viktor V. Yotov, Stoil I. Ivanov
Publication date: 15 February 2018
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-017-0225-4
numerical exampleerror estimatessemilocal convergencelocal convergencepolynomial zerosSchröder's methodmultiple zeroscone normed space
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
- Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros
- Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros
- Convergence of the two-point Weierstrass root-finding method
- On a family of Weierstrass-type root-finding methods with accelerated convergence
- Numerical methods for roots of polynomials. Part I
- On the convergence of Halley's method for simultaneous computation of polynomial zeros
- Relationships between different types of initial conditions for simultaneous root finding methods
- Point estimation of root finding methods
- General local convergence theory for a class of iterative processes and its applications to Newton's method
- Parallel square-root iterations for multiple roots
- A basic family of iteration functions for polynomial root finding and its characterizations
- A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
- Simultaneous point estimates for Newton's method
- A unified theory of cone metric spaces and its applications to the fixed point theory
- On the convergence of Halley's method for multiple polynomial zeros
- A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
- On the convergence of Chebyshev's method for multiple polynomial zeros
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- An algorithm for the total, or partial, factorization of a polynomial
- Solving a Polynomial Equation: Some History and Recent Progress
- Some higher-order methods for the simultaneous approximation of multiple polynomial zeros
- Some generalizations of the Chebyshev method for simultaneous determination of all roots of polynomial equations
- A new simultaneous method of fourth order for finding complex zeros in circular interval arithmetic
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
This page was built for publication: On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity