Pages that link to "Item:Q738970"
From MaRDI portal
The following pages link to On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity (Q738970):
Displaying 8 items.
- Dynamic study of Schröder's families of first and second kind (Q1652796) (← links)
- Symbolic computation and computer graphics as tools for developing and studying new root-finding methods (Q1734734) (← 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)
- On a high-order one-parameter family for the simultaneous determination of polynomial roots (Q2411134) (← links)
- On optimal parameter of Laguerre's family of zero-finding methods (Q5031805) (← 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)
