Pages that link to "Item:Q2518679"
From MaRDI portal
The following pages link to Computational efficiency of some combined methods for polynomial equations (Q2518679):
Displaying 5 items.
- The self-validated method for polynomial zeros of high efficiency (Q1034672) (← links)
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial (Q1044413) (← links)
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (Q2291994) (← links)
- Chebyshev-like root-finding methods with accelerated convergence (Q3011656) (← links)
- On the improved Newton-like methods for the inclusion of polynomial zeros (Q5747715) (← links)
