Pages that link to "Item:Q1272804"
From MaRDI portal
The following pages link to Convergence conditions of some methods for the simultaneous computation of polynomial zero (Q1272804):
Displaying 25 items.
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously (Q262691) (← links)
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros (Q331804) (← links)
- Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros (Q343681) (← links)
- Exact symbolic-numeric computation of planar algebraic curves (Q387800) (← links)
- Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials (Q697487) (← links)
- On the guaranteed convergence of new two-point root-finding methods for polynomial zeros (Q742856) (← links)
- On new higher order families of simultaneous methods for finding polynomial zeros (Q952049) (← links)
- General local convergence theory for a class of iterative processes and its applications to Newton's method (Q998977) (← links)
- Improvement of a convergence condition for Durand-Kerner iteration (Q1298639) (← links)
- The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros (Q1568729) (← links)
- Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence (Q1760574) (← links)
- Simultaneous point estimates for Newton's method (Q1864771) (← links)
- On some methods for the simultaneous determination of polynomial zeros (Q1922231) (← links)
- On initial conditions for the convergence of simultaneous root finding methods (Q1924484) (← links)
- Solving secular and polynomial equations: a multiprecision algorithm (Q2253077) (← links)
- On the convergence of Halley's method for multiple polynomial zeros (Q2354280) (← links)
- Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
- Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367) (← links)
- Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros (Q2424923) (← links)
- Optimal inequality factor for Durand-Kerner's and Tanabe's methods (Q2839539) (← links)
- On the convergence order for some methods of simultaneous root finding for polynomials using a computer algebra system (Q2881180) (← links)
- An unconditionally convergent method for computing zeros of splines and polynomials (Q3426025) (← links)
- On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros (Q5225442) (← links)
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method (Q5963455) (← links)
