Pages that link to "Item:Q3311582"
From MaRDI portal
The following pages link to A Termination Criterion for Iterative Methods Used to Find the Zeros of Polynomials (Q3311582):
Displayed 11 items.
- On an new open type variant of Newton's method (Q275579) (← links)
- Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
- Practical stopping rule for finding roots of nonlinear equations (Q1065501) (← links)
- Practical problems arising for finding roots of nonlinear equations (Q1089744) (← links)
- A comparison of methods for terminating polynomial iterations (Q1113616) (← links)
- Empirical versus asymptotic rate of convergence of a class of methods for solving a polynomial equation (Q1372037) (← links)
- Some new variants of Newton's method. (Q1764581) (← links)
- Relationships between order and efficiency of a class of methods for multiple zeros of polynomials (Q1900755) (← links)
- A derivative free globally convergent method and its deformations (Q2048947) (← links)
- Geometric mean Newton's method for simple and multiple roots (Q2472817) (← links)
- Variant of Newton's method using Simpson's 3/8th rule (Q2657538) (← links)