Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
From MaRDI portal
Publication:1734734
DOI10.1016/j.amc.2016.09.025zbMath1411.68212OpenAlexW2534581132MaRDI QIDQ1734734
Đorđe D. Herceg, Ivan Petković
Publication date: 27 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2016.09.025
symbolic computationbasin of attractioncomputer graphicsmultiple zerossolving nonlinear equationsdynamic study
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to single equations (65H05)
Related Items (6)
Computational geometry as a tool for studying root-finding methods ⋮ Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials ⋮ On generalized Halley-like methods for solving nonlinear equations ⋮ On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros ⋮ Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros ⋮ Computer tools for the construction and analysis of some efficient root-finding simultaneous methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improvement of Chebyshev-Halley methods free from second derivative
- Different anomalies in a Jarratt family of iterative root-finding methods
- A new tool to study real dynamics: the convergence plane
- On the convergence of an optimal fourth-order family of methods and its dynamics
- On optimal fourth-order iterative methods free from second derivative and their 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
- Convergence, efficiency and dynamics of new fourth and sixth order families of iterative methods for nonlinear systems
- On a family of Laguerre methods to find multiple roots of nonlinear equations
- Stability study of eighth-order iterative methods for solving nonlinear equations
- Constructing higher-order methods for obtaining the multiple roots of nonlinear equations
- Basins of attraction for several third order methods to find multiple roots of nonlinear equations
- Graphic and numerical comparison between iterative methods
- Transformation methods for finding multiple roots of nonlinear equations
- Modified Jarratt method for computing multiple roots
- A new fourth-order iterative method for finding multiple roots of nonlinear equations
- On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity
- New families of nonlinear third-order solvers for finding multiple roots
- Some fourth-order nonlinear solvers with closed formulae for multiple roots
- A third-order modification of Newton's method for multiple roots
- A family of root finding methods
- Construction of fourth-order optimal families of iterative methods and their dynamics
- Dynamics of the King and Jarratt iterations
- Dynamics of a family of third-order iterative methods that do not require using second derivatives
- Computing the zeros of analytic functions
- 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
- Complex dynamics of derivative-free methods for nonlinear equations
- Dynamics of a family of Chebyshev-Halley type methods
- High-order nonlinear solver for multiple roots
- A non-iterative method for solving non-linear equations
- On Halley's Iteration Method
- An algorithm for the total, or partial, factorization of a polynomial
- The Laguerre Iteration in Solving the Symmetric Tridiagonal Eigenproblem, Revisited
- A family of Chebyshev-Halley type methods in Banach spaces
- Laguerre's Method Applied to the Matrix Eigenvalue Problem
- Über eine Verallgemeinerung des Newtonschen Näherungsverfahrens
- A note on \(Q\)-order of convergence
This page was built for publication: Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
