Pages that link to "Item:Q1734734"
From MaRDI portal
The following pages link to Symbolic computation and computer graphics as tools for developing and studying new root-finding methods (Q1734734):
Displaying 6 items.
- On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros (Q2008912) (← links)
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (Q2291994) (← links)
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials (Q2402410) (← links)
- Computational geometry as a tool for studying root-finding methods (Q5080708) (← links)
- On generalized Halley-like methods for solving nonlinear equations (Q5091836) (← links)
- Computer tools for the construction and analysis of some efficient root-finding simultaneous methods (Q5865291) (← links)