On the global convergence of Schröder's iterative formulae for real roots of algebraic equations
DOI10.1016/J.CAM.2018.05.041zbMATH Open1398.65097OpenAlexW2805764141MaRDI QIDQ724512FDOQ724512
Authors: Takemitsu Hasegawa, Hiroshi Sugiura 
Publication date: 26 July 2018
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.2018.05.041
Recommendations
- On the global convergence of Schröder's iteration formula for real zeros of entire functions
- On the convergence of Schröder iteration functions for pth roots of complex numbers
- Regions of convergence and dynamics of Schröder-like iteration formulae as applied to complex polynomial equations with multiple roots
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity
- Convergence of Schröder method for polynomial zeros of unknown multiplicity
- A new type of globally convergent iteration method for finding roots of functional equation
- On Schröder's families of root-finding methods
- Convergence and dynamics of structurally identical root finding methods
- On the convergence of a family of Weierstrass-type root-finding methods
nonlinear equationroot findingglobal and monotonic convergencepolynomial real zerosSchröder's method
Numerical computation of roots of polynomial equations (65H04) Numerical computation of solutions to single equations (65H05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration functions
- A family of root finding methods
- Geometric constructions of iterative functions to solve nonlinear equations
- On Schröder's families of root-finding methods
- Title not available (Why is that?)
- Numerical algorithms based on analytic function values at roots of unity
- Numerical computing with IEEE floating point arithmetic. Incl. one theorem, one rule of thumb, and one hundred and one exercises
- A first course in numerical analysis.
- The Schwarzian-Newton method for solving nonlinear equations, with applications
- On the Julia set of König's root-finding algorithms
- Generalizations of Laguerre’s Method: Higher Order Methods
- Generalized Computation of Schröder Iteration Functions To Motivate Families of Julia and Mandelbrot-Like Sets
- On extraneous fixed-points of the basic family of iteration functions
- Title not available (Why is that?)
- The quasi-Laguerre iteration
- Root determination by use of Padé approximants
- On the global convergence of Halley's iteration formula
- On Halley iteration
- A one parameter family of locally quartically convergent zero-finding methods
- On a high-order one-parameter family for the simultaneous determination of polynomial roots
- Padésche Näherungsbrüche und Iterationsverfahren höherer Ordnung
- A class of iterative methods for holomorphic functions
- Fixed point and Newton's methods for solving a nonlinear equation: from linear to high-order convergence
- On an efficient method for the simultaneous approximation of polynomial multiple roots
- Comments on a root finding method using Padé approximation
- Title not available (Why is that?)
Cited In (3)
- On the global convergence of Schröder's iteration formula for real zeros of entire functions
- Regions of convergence and dynamics of Schröder-like iteration formulae as applied to complex polynomial equations with multiple roots
- Estimating convergence regions of Schröder's iteration formula: how the Julia set shrinks to the Voronoi boundary
This page was built for publication: On the global convergence of Schröder's iterative formulae for real roots of algebraic equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724512)
