Point estimation of root finding methods
algebraic equationsconvergencenumerical resultspoint estimation theorypolynomial zerosroot finding methodstextbook
Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical computation of solutions to single equations (65H05)
In this book, the author presents the basic concepts for convergent root finding methods and studies estimations of zero finding methods from data at one point using Smale's point estimation theory, by constructing such initial conditions, providing guaranteed convergence. Furthermore the author proposes the construction of computationally verifiable initial conditions and studies the corresponding convergence analysis of the simultaneous methods, which predict the immediate appearance of the guaranteed and fast convergence of iterative root finding methods. Additionally, the author presents higher order families of simultaneous methods for the determination of polynomial (simple or multiple) zeros. Finally, numerical results, illustrating the convergence behavior, are presented.
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- scientific article; zbMATH DE number 1313043
- scientific article; zbMATH DE number 6451405
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- Safe convergence of simultaneous methods for polynomial zeros
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
- A class of root finding methods
- Point estimation and some applications to iterative methods
- A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros
- Dynamic study of Schröder's families of first and second kind
- Dynamics and limiting behavior of Julia sets of König's method for multiple roots
- On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity
- Simultaneous point estimates for Newton's method
- The theory of Smale's point estimation and its applications
- On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
- Computer visualization and dynamic study of new families of root-solvers
- A unified theory of cone metric spaces and its applications to the fixed point theory
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
- On an efficient simultaneous method for finding polynomial zeros
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- On a high-order one-parameter family for the simultaneous determination of polynomial roots
- Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
- Sampling algebraic sets in local intrinsic coordinates
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
- Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
- A three point formula for finding roots of equations by the method of least squares
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros
- Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
- Convergence of the two-point Weierstrass root-finding method
- scientific article; zbMATH DE number 1313043 (Why is no real title available?)
- scientific article; zbMATH DE number 1124031 (Why is no real title available?)
- The improved Farmer--Loizou method for finding polynomial zeros
- On optimal parameter of Laguerre's family of zero-finding methods
- On generalized Halley-like methods for solving nonlinear equations
- On using symmetric polynomials for constructing root finding methods
- On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method
- scientific article; zbMATH DE number 6451405 (Why is no real title available?)
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros
- On the improved Newton-like methods for the inclusion of polynomial zeros
- Computer tools for the construction and analysis of some efficient root-finding simultaneous methods
- ON INVERSE ITERATION PROCESS FOR FINDING ALL ROOTS OF NONLINEAR EQUATIONS WITH APPLICATIONS
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence
- Families of high-order simultaneous methods with several corrections
- On a family of Weierstrass-type root-finding methods with accelerated convergence
- On the guaranteed convergence of new two-point root-finding methods for polynomial zeros
- Finding special points using matrix-free predictor-corrector methods
- Relationships between different types of initial conditions for simultaneous root finding methods
This page was built for publication: Point estimation of root finding methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930436)
