Computer visualization and dynamic study of new families of root-solvers
From MaRDI portal
Publication:2231295
DOI10.1016/j.cam.2021.113775zbMath1490.65091OpenAlexW3193945677MaRDI QIDQ2231295
Ivan Petković, Đorđe D. Herceg
Publication date: 29 September 2021
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2021.113775
Analysis of algorithms (68W40) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical computation of solutions to single equations (65H05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of an optimal fourth-order family of methods and its dynamics
- Basin attractors for various methods
- Basin attractors for various methods for multiple roots
- Basins of attraction for several methods to find simple roots of nonlinear equations
- On a family of Laguerre methods to find multiple roots of nonlinear equations
- Comparative study of eighth-order methods for finding simple roots of nonlinear equations
- Graphic and numerical comparison between iterative methods
- Numerical methods for roots of polynomials. Part I
- Relationships between different types of initial conditions for simultaneous root finding methods
- Point estimation of root finding methods
- On Popovski's method for nonlinear equations
- General local convergence theory for a class of iterative processes and its applications to Newton's method
- Locating multiple zeros interactively
- A family of root finding methods
- Comparative study of methods of various orders for finding repeated roots of nonlinear equations
- Numerical methods for roots of polynomials. II
- Computers in mathematical research: the study of three-point root-finding methods
- Basins of attraction for Zhou-Chen-song fourth order family of methods for multiple roots
- Basins of attraction for several optimal fourth order methods for multiple roots
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- Complex dynamics of derivative-free methods for nonlinear equations
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- A family of one-point iteration formulae for finding roots
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- A note on \(Q\)-order of convergence
This page was built for publication: Computer visualization and dynamic study of new families of root-solvers