Pages that link to "Item:Q5080708"
From MaRDI portal
The following pages link to Computational geometry as a tool for studying root-finding methods (Q5080708):
Displaying 7 items.
- Iterative schemes for finding all roots simultaneously of nonlinear equations (Q2171149) (← links)
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (Q2291994) (← links)
- (Q4980497) (← links)
- A new optimal root-finding iterative algorithm: local and semilocal analysis with polynomiography (Q6202789) (← links)
- Local and semi-local convergence and dynamic analysis of a time-efficient nonlinear technique (Q6549564) (← links)
- From Halley to secant: redefining root finding with memory-based methods including convergence and stability (Q6559945) (← links)
- A novel Noor iterative method of operators with property (\(E\)) as concerns convex programming applicable in signal recovery and polynomiography (Q6574492) (← links)
