Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
From MaRDI portal
Publication:1734734
Recommendations
- On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity
- Computer visualization and dynamic study of new families of root-solvers
- Multipoint iterative methods for finding all the simple zeros in an interval
- Using symbolic computation in Mathematica for verifying the convergence of the iterative methods
- Proving the convergence of the iterative methods by using symbolic computation in Maple
Cites work
- A family of Chebyshev-Halley type methods in Banach spaces
- A family of root finding methods
- A new fourth-order iterative method for finding multiple roots of nonlinear equations
- A new tool to study real dynamics: the convergence plane
- A non-iterative method for solving non-linear equations
- A note on \(Q\)-order of convergence
- A third-order modification of Newton's method for multiple roots
- An algorithm for the total, or partial, factorization of a polynomial
- An improvement of Chebyshev-Halley methods free from second derivative
- 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 several third order methods to find multiple roots of nonlinear equations
- Basins of attraction for Zhou-Chen-song fourth order family of methods for multiple roots
- Complex dynamics of derivative-free methods for nonlinear equations
- Computing the zeros of analytic functions
- Constructing higher-order methods for obtaining the multiple roots of nonlinear equations
- Construction of fourth-order optimal families of iterative methods and their dynamics
- Convergence, efficiency and dynamics of new fourth and sixth order families of iterative methods for nonlinear systems
- Different anomalies in a Jarratt family of iterative root-finding methods
- Dynamics of a family of Chebyshev-Halley type methods
- Dynamics of a family of third-order iterative methods that do not require using second derivatives
- Dynamics of the King and Jarratt iterations
- Graphic and numerical comparison between iterative methods
- High-order nonlinear solver for multiple roots
- scientific article; zbMATH DE number 5552087 (Why is no real title available?)
- scientific article; zbMATH DE number 3778641 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 1881996 (Why is no real title available?)
- scientific article; zbMATH DE number 5165921 (Why is no real title available?)
- scientific article; zbMATH DE number 3255157 (Why is no real title available?)
- scientific article; zbMATH DE number 3407053 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Laguerre's Method Applied to the Matrix Eigenvalue Problem
- Modified Jarratt method for computing multiple roots
- New families of nonlinear third-order solvers for finding multiple roots
- On a family of Laguerre methods to find 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
- On Halley's Iteration Method
- On optimal fourth-order iterative methods free from second derivative and their dynamics
- On the convergence of an optimal fourth-order family of methods and its dynamics
- Polynomial root-finding and polynomiography
- Review of some iterative root-finding methods from a dynamical point of view
- Some fourth-order nonlinear solvers with closed formulae for multiple roots
- Stability study of eighth-order iterative methods for solving nonlinear equations
- The Laguerre Iteration in Solving the Symmetric Tridiagonal Eigenproblem, Revisited
- Transformation methods for finding multiple roots of nonlinear equations
- Über eine Verallgemeinerung des Newtonschen Näherungsverfahrens
Cited in
(12)- On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros
- Computer visualization and dynamic study of new families of root-solvers
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
- Multipoint iterative methods for finding all the simple zeros in an interval
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- Proving the convergence of the iterative methods by using symbolic computation in Maple
- Computational geometry as a tool for studying root-finding methods
- On generalized Halley-like methods for solving nonlinear equations
- Using symbolic computation in Mathematica for verifying the convergence of the iterative methods
- Computer tools for the construction and analysis of some efficient root-finding simultaneous methods
- Thorough investigation of exact wave solutions in nonlinear thermoelasticity theory under the influence of gravity using advanced analytical methods
- 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: Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734734)
