Graphic and numerical comparison between iterative methods
From MaRDI portal
Publication:697110
DOI10.1007/BF03025310zbMATH Open1003.65046OpenAlexW2067520338MaRDI QIDQ697110FDOQ697110
Authors: Juan Luis Varona 
Publication date: 16 September 2002
Published in: The Mathematical Intelligencer (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03025310
Recommendations
- A comparison between iterative methods by using the basins of attraction
- Newton's method's basins of attraction revisited
- Generating the basins of attraction for Newton's method
- Numerical experiments on attraction basin
- Newton's method with fractional derivatives and various iteration processes via visual analysis
iterative methodsJulia setsNewton's methodfractal picturesregions of convergenceroots of nonlinear equations
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical computation of solutions to single equations (65H05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A family of Chebyshev-Halley type methods in Banach spaces
- Some Fourth Order Multipoint Iterative Methods for Solving Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Family of Fourth Order Methods for Nonlinear Equations
- Complex analytic dynamics on the Riemann sphere
- Title not available (Why is that?)
- Iteration of meromorphic functions
- Title not available (Why is that?)
- The application of an inverse-free Jarratt-type approximation to nonlinear integral equations of Hammerstein-type
- On Halley's Iteration Method
- The Jarratt method in Banach space setting
- On a convex acceleration of Newton's method
- Symmetry groups of fractals
- Mysteries of mathematics and computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Continuous Newton's method for polynomials.
Cited In (only showing first 100 items - show all)
- On a numerical technique for finding multiple zeros and its dynamic
- A comparison between iterative methods by using the basins of attraction
- Generating root-finder iterative methods of second order: convergence and stability
- Newton's method's basins of attraction revisited
- Influence of the multiplicity of the roots on the basins of attraction of Newton's method
- Dynamics of a higher-order family of iterative methods
- Higher-order derivative-free families of Chebyshev-Halley type methods with or without memory for solving nonlinear equations
- Convergence and dynamics of structurally identical root finding methods
- An optimal fourth order iterative method for solving nonlinear equations and its dynamics
- Comparison results between Jacobi and other iterative methods
- Measures of the Basins of Attracting n-Cycles for the Relaxed Newton’s Method
- Stability and applicability of iterative methods with memory
- King-type derivative-free iterative families: real and memory dynamics
- Dynamics and fractal dimension of Steffensen-type methods
- A new third-order Newton-type iterative method for solving nonlinear equations
- Polynomiography for the polynomial infinity norm via Kalantari's formula and nonstandard iterations
- Dynamics of a new family of iterative processes for quadratic polynomials
- An adaptive Newton-method based on a dynamical systems approach
- Methods with prefixed order for approximating square roots with global and general convergence
- Several new third-order iterative methods for solving nonlinear equations
- A new tool to study real dynamics: the convergence plane
- A novel family of weighted-Newton optimal eighth order methods with dynamics
- Efficient methods of optimal eighth and sixteenth order convergence for solving nonlinear equations
- A stable class of improved second-derivative free Chebyshev-Halley type methods with optimal eighth order convergence
- New modification of Maheshwari's method with optimal eighth order convergence for solving nonlinear equations
- An efficient family of optimal fourth-order iterative methods for finding multiple roots of nonlinear equations
- Multipoint methods for solving nonlinear equations: a survey
- An Ulm-type method with \(R\)-order of convergence three
- Superattracting extraneous fixed points and \(n\)-cycles for Chebyshev's method on cubic polynomials
- The ``Gauss-Seidelization of iterative methods for solving nonlinear equations in the complex plane
- Some real-life applications of a newly constructed derivative free iterative scheme
- Study of iterative methods through the Cayley quadratic test
- Orbits of period two in the family of a multipoint variant of Chebyshev-Halley family
- On some families of multi-point iterative methods for solving nonlinear equations
- New class of eighth-order iterative zero-finders and their basins of attraction
- Some iterative methods free from derivatives and their basins of attraction for nonlinear equations
- Dynamical study while searching equilibrium solutions in \(N\)-body problem
- Stability of a fourth order bi-parametric family of iterative methods
- An improvement of the region of accessibility of Chebyshev’s method from Newton’s method
- Chaos in King's iterative family
- Dynamical aspects of some convex acceleration methods as purely iterative algorithm for Newton's maps
- Dynamics of a family of Chebyshev-Halley type methods
- A modification of Cauchy's method for quadratic equations
- Chaos and convergence of a family generalizing Homeier's method with damping parameters
- Derivative free iterative methods for nonlinear systems
- Optimal fourth-order Weerakoon-Fernando-type methods for multiple roots and their dynamics
- An analysis of the properties of the variants of Newton's method with third order convergence
- Efficient two-step derivative-free iterative methods with memory and their dynamics
- On the local convergence of a fifth-order iterative method in Banach spaces
- A new class of derivative-free root solvers with increasing optimal convergence order and their complex dynamics
- Computing multiple zeros by using a parameter in Newton-secant method
- An optimization algorithm based on chaotic behavior and fractal nature
- Title not available (Why is that?)
- On the dynamics of some Newton's type iterative functions
- On Steffensen's method on Banach spaces
- An optimization of Chebyshev's method
- Higher order methods of the basic family of iterations via \(S\)-iteration scheme with \(s\)-convexity
- Period-doubling bifurcations in the family of Chebyshev–Halley-type methods
- Some variants of the Chebyshev-Halley family of methods with fifth order of convergence
- On some one-point hybrid iterative methods
- A first overview on the real dynamics of Chebyshev's method
- Construction of fourth-order optimal families of iterative methods and their dynamics
- Bivariate Newton-Raphson method and toroidal attraction basins
- An optimal three-point eighth-order iterative method without memory for solving nonlinear equations with its dynamics
- A sixth order transformation method for finding multiple roots of nonlinear equations and basin attractors for various methods
- Graphical representations for the homogeneous bivariate Newton's method
- A complex dynamical approach of Chebyshev's method
- Optimal Newton–Secant like methods without memory for solving nonlinear equations with its dynamics
- Computer tools for the construction and analysis of some efficient root-finding simultaneous methods
- An optimal thirty-second-order iterative method for solving nonlinear equations and a conjecture
- Visual Exploration of Complex Functions
- A study on the local convergence and dynamics of the two-step and derivative-free Kung-Traub's method
- High order algorithms for approximatingnth roots
- Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
- Numerical properties of different root-finding algorithms obtained for approximating continuous Newton's method
- A multi-point iterative method for solving nonlinear equations with optimal order of convergence
- An efficient class of Traub-Steffensen-like seventh order multiple-root solvers with applications
- Computer visualization and dynamic study of new families of root-solvers
- Computational geometry as a tool for studying root-finding methods
- Disconnected Julia set of Halley's method for exponential maps
- On obtaining convergence order of a fourth and sixth order method of Hueso et al. without using Taylor series expansion
- Dynamics of iterative families with memory based on weight functions procedure
- General family of third order methods for multiple roots of nonlinear equations and basin attractors for various methods
- Algorithms for computing basins of attraction associated with a rational self-map of the Hopf fibration based on Lyapunov exponents
- Dynamics of a fifth-order iterative method
- Dynamic study of Schröder's families of first and second kind
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
- Numerical experiments on attraction basin
- Existence and Uniqueness of Solution for Semi-linear Conservation Laws with Velocity Field in L∞
- The Newton-Raphson method and adaptive ODE solvers
- Improving the accessibility of Steffensen's method by decomposition of operators
- A study of \(3 \mu\)th-order of convergence of Chebyshev-Halley family method and its convergence plane
- EFFICIENT NUMERICAL METHODS OF AITKEN TYPE AND THEIR DYNAMICS
- On generalized Halley-like methods for solving nonlinear equations
- A Qualitative Analysis of a Family of Newton-Like Iterative Process with R-Order of Convergence At Least Three
- Basins of attraction of a one-parameter family of root-finding techniques
- High-efficiency parametric iterative schemes for solving nonlinear equations with and without memory
- An efficient class of Traub-Steffensen-type methods for computing multiple zeros
- Review of some iterative methods for solving nonlinear equations with multiple zeros
- Efficient optimal families of higher-order iterative methods with local convergence
Uses Software
This page was built for publication: Graphic and numerical comparison between iterative methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697110)
