Pages that link to "Item:Q3761579"
From MaRDI portal
The following pages link to On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros (Q3761579):
Displayed 17 items.
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- Iteration functions re-visited (Q730575) (← links)
- On the efficiency of some combined methods for polynomial complex zeros (Q911229) (← 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)
- Annular bounds for the zeros of a polynomial (Q1751320) (← links)
- Modified Newton method in circular interval arithmetic (Q1904962) (← links)
- On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros (Q2279594) (← links)
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (Q2291994) (← links)
- On iteration methods without derivatives for the simultaneous determination of polynomial zeros (Q2366429) (← links)
- A highly efficient root-solver of very fast convergence (Q2378767) (← links)
- On region containing all the zeros of a polynomial (Q2453362) (← links)
- On Geometry of the Zeros of a Polynomial (Q2790432) (← links)
- The Scientific Work of Gradimir V. Milovanović (Q3086881) (← links)
- A Neural Root Finder of Polynomials Based on Root Moments (Q4832491) (← links)
- On comparison of annuli containing all the zeros of a polynomial (Q5034286) (← links)
- On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros (Q5225442) (← links)