On general convergence in extracting radicals via a fundamental family of iteration functions
From MaRDI portal
Publication:2370693
DOI10.1016/j.cam.2006.08.035zbMath1118.65035MaRDI QIDQ2370693
Publication date: 29 June 2007
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.2006.08.035
visualization; Newton's method; discrete dynamical systems; root-finding; general convergence; iteration functions; computer algebra system Maple
68W30: Symbolic computation and algebraic computation
65H05: Numerical computation of solutions to single equations
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration functions
- Families of rational maps and iterative root-finding algorithms
- A basic family of iteration functions for polynomial root finding and its characterizations
- On extraneous fixed-points of the basic family of iteration functions
- High order iterative methods for approximating square roots
- Newton's method and generation of a determinantal family of iteration functions
- Complex analytic dynamics on the Riemann sphere
- On the efficiency of algorithms of analysis
- Accelerated Convergence in Newton’s Method
- Solving a Polynomial Equation: Some History and Recent Progress
- On K nig's root-finding algorithms*
- Accelerated Convergence in Newton’s Method
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications
- How to find all roots of complex polynomials by Newton's method.