On the local convergence of Ehrlich method for numerical computation of polynomial zeros
From MaRDI portal
(Redirected from Publication:331804)
Recommendations
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
- Semilocal convergence of two iterative methods for simultaneous computation of polynomial zeros
- scientific article; zbMATH DE number 4016047
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
- A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
Cites work
- scientific article; zbMATH DE number 996039 (Why is no real title available?)
- scientific article; zbMATH DE number 3839233 (Why is no real title available?)
- scientific article; zbMATH DE number 3872574 (Why is no real title available?)
- scientific article; zbMATH DE number 3795285 (Why is no real title available?)
- A modified Newton method for polynomials
- Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
- Convergence conditions of some methods for the simultaneous computation of polynomial zero
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- General local convergence theory for a class of iterative processes and its applications to Newton's method
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- Numerical computation of polynomial zeros by means of Aberth's method
- Numerical methods for roots of polynomials. II
- Numerical methods for roots of polynomials. Part I
- On the convergence order of a modified method for simultaneous finding polynomial zeros
- Point estimation of root finding methods
- Relationships between different types of initial conditions for simultaneous root finding methods
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
Cited in
(18)- A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
- scientific article; zbMATH DE number 4016047 (Why is no real title available?)
- Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
- scientific article; zbMATH DE number 6395662 (Why is no real title available?)
- Semilocal convergence of two iterative methods for simultaneous computation of polynomial zeros
- On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros
- Unified convergence analysis for Picard iteration in n-dimensional vector spaces
- An iterative scheme to obtain multiple solutions simultaneously
- A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros
- Simultaneous roots for vectorial problems
- A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
- On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity
- On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation
- On dynamics of iterative techniques for nonlinear equation with applications in engineering
- On the Location of Zeroes of Polynomials from the Stability Analysis of Novel Strong-Form Meshless Random Differential Quadrature Method
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
- scientific article; zbMATH DE number 3881776 (Why is no real title available?)
This page was built for publication: On the local convergence of Ehrlich method for numerical computation of polynomial zeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331804)
