Computer visualization and dynamic study of new families of root-solvers
From MaRDI portal
Recommendations
- Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
- On a high-order one-parameter family for the simultaneous determination of polynomial roots
- A family of simultaneous zero finding methods
- On new higher order families of simultaneous methods for finding polynomial zeros
- On an efficient family of simultaneous methods for finding polynomial multiple zeros
Cites work
- A family of one-point iteration formulae for finding roots
- A family of root finding methods
- A note on \(Q\)-order of convergence
- 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
- Basins of attraction for several optimal fourth order methods for multiple roots
- Basins of attraction for Zhou-Chen-song fourth order family of methods for multiple roots
- Comparative study of eighth-order methods for finding simple roots of nonlinear equations
- Comparative study of methods of various orders for finding repeated roots of nonlinear equations
- Complex dynamics of derivative-free methods for nonlinear equations
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
- Computers in mathematical research: the study of three-point root-finding methods
- General local convergence theory for a class of iterative processes and its applications to Newton's method
- Graphic and numerical comparison between iterative methods
- scientific article; zbMATH DE number 996039 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 3255157 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Locating multiple zeros interactively
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- Numerical methods for roots of polynomials. II
- Numerical methods for roots of polynomials. Part I
- On a family of Laguerre methods to find multiple roots of nonlinear equations
- On Popovski's method for nonlinear equations
- On the convergence of an optimal fourth-order family of methods and its dynamics
- Point estimation of root finding methods
- Polynomial root-finding and polynomiography
- Relationships between different types of initial conditions for simultaneous root finding methods
- Review of some iterative root-finding methods from a dynamical point of view
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
Cited in
(6)- Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
- An optimal thirty-second-order iterative method for solving nonlinear equations and a conjecture
- Computer tools for solving mathematical problems: a review
- A novel optimal fourth-order iteration scheme for solving nonlinear problems in applied sciences
- A robust family of optimal fourth-order iteration schemes for multiple roots with applications
- On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity
This page was built for publication: Computer visualization and dynamic study of new families of root-solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2231295)
