Pages that link to "Item:Q658659"
From MaRDI portal
The following pages link to A comparison between iterative methods by using the basins of attraction (Q658659):
Displaying 18 items.
- Unification of sixth-order iterative methods (Q387093) (← links)
- On improved three-step schemes with high efficiency index and their dynamics (Q393759) (← links)
- Estimating the Hausdorff-Besicovitch dimension of boundary of basin of attraction in helicopter trim (Q450265) (← links)
- Graphic and numerical comparison between iterative methods (Q697110) (← links)
- On the complex dynamics of continued and discrete Cauchy's method (Q1679938) (← links)
- Polynomiography for the polynomial infinity norm via Kalantari's formula and nonstandard iterations (Q1736112) (← links)
- Comparing the geometry of the basins of attraction, the speed and the efficiency of several numerical methods (Q1794682) (← links)
- Bisheh-Niasar-Saadatmandi root finding method via the \(S\)-iteration with periodic parameters and its polynomiography (Q1997529) (← links)
- Convergence and dynamics of structurally identical root finding methods (Q2012637) (← links)
- A new third-order Newton-type iterative method for solving nonlinear equations (Q2016301) (← links)
- Applications of accelerated computational methods for quasi-nonexpansive operators to optimization problems (Q2156917) (← links)
- Higher order methods of the basic family of iterations via \(S\)-iteration scheme with \(s\)-convexity (Q2310425) (← links)
- Contrasts in the basins of attraction of structurally identical iterative root finding methods (Q2451437) (← links)
- (Q4918691) (← links)
- Basins of attraction of a one-parameter family of root-finding techniques (Q6491287) (← 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)
