Pages that link to "Item:Q5527440"
From MaRDI portal
The following pages link to A modified Newton method for polynomials (Q5527440):
Displaying 50 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)
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method (Q389577) (← links)
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- The point zoro symmetric single-step procedure for simultaneous estimation of polynomial zeros (Q443044) (← links)
- Traub's accelerating generator of iterative root-finding methods (Q540311) (← links)
- Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
- Iteration functions re-visited (Q730575) (← links)
- Cylinder partition function of the 6-vertex model from algebraic geometry (Q783974) (← links)
- Coefficient-free adaptations of polynomial root-finders (Q814095) (← links)
- A modified Newton method in parallel circular iteration of single-step and double-step (Q814105) (← links)
- Construction of zero-finding methods by Weierstrass functions (Q879490) (← links)
- On the efficiency of some combined methods for polynomial complex zeros (Q911229) (← links)
- On new higher order families of simultaneous methods for finding polynomial zeros (Q952049) (← links)
- Accelerating generators of iterative methods for finding multiple roots of nonlinear equations (Q988247) (← links)
- The self-validated method for polynomial zeros of high efficiency (Q1034672) (← links)
- A note on some improvements of the simultaneous methods for determination of polynomial zeros (Q1050090) (← links)
- Some parallel methods for polynomial root-finding (Q1091080) (← links)
- Initial approximations in Durand-Kerner's root finding method (Q1093327) (← links)
- Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros (Q1112563) (← links)
- A family of simultaneous zero-finding methods (Q1130393) (← links)
- On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic (Q1146966) (← links)
- On an iterative method for simultaneous inclusion of polynomial complex zeros (Q1163339) (← links)
- On the convergence order of a modified method for simultaneous finding polynomial zeros (Q1171870) (← links)
- On the generalization of the Alefeld-Herzberger's method (Q1184705) (← links)
- On the \(R\)-order of some accelerated methods for the simultaneous finding of polynomial zeros (Q1207050) (← links)
- An iteration formula for the simultaneous determination of the zeros of a polynomial (Q1221475) (← links)
- Some simultaneous iterations for finding all zeros of a polynomial with high order convergence (Q1294297) (← links)
- An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction (Q1319612) (← links)
- Solving certain queueing problems modelled by Toeplitz matrices (Q1346993) (← links)
- On nonlinear SOR-like methods. I: Applications to simultaneous methods for polynomial zeros (Q1365319) (← links)
- Point estimation and some applications to iterative methods (Q1387244) (← links)
- A general method to generate parallel iterations for finding all zeros of polynomial simultaneously (Q1387450) (← links)
- Comments on some recent methods for the simultaneous determination of polynomial zeros (Q1612422) (← links)
- A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros (Q1643868) (← links)
- A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods (Q1733448) (← links)
- The convergence of a class of parallel Newton-type iterative methods (Q1750816) (← links)
- Annular bounds for the zeros of a polynomial (Q1751320) (← links)
- The convergence of a family of parallel zero-finding methods (Q1767950) (← links)
- Family of simultaneous methods of Hansen--Patrick's type (Q1878394) (← links)
- On a modification of the Koenig theorem (Q1893456) (← links)
- Lower bounds for the \(R\)-order of convergence of simultaneous inclusion methods for polynomial roots and related iteration methods (Q1900748) (← links)
- On some methods for the simultaneous determination of polynomial zeros (Q1922231) (← links)
- On some simultaneous methods based on Weierstrass' correction (Q1923458) (← links)
- On initial conditions for the convergence of simultaneous root finding methods (Q1924484) (← links)
- The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis (Q1940317) (← links)
- Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions (Q2002783) (← links)
- The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem (Q2068644) (← links)
- On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation (Q2167257) (← links)
- Iterative schemes for finding all roots simultaneously of nonlinear equations (Q2171149) (← links)
