Point estimation of root finding methods
From MaRDI portal
Publication:930436
DOI10.1007/978-3-540-77851-6zbMath1160.65017OpenAlexW634742382MaRDI QIDQ930436
Publication date: 30 June 2008
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77851-6
convergencenumerical resultstextbookalgebraic equationspolynomial zerosroot finding methodspoint estimation theory
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)
Related Items (36)
On optimal parameter of Laguerre's family of zero-finding methods ⋮ ON INVERSE ITERATION PROCESS FOR FINDING ALL ROOTS OF NONLINEAR EQUATIONS WITH APPLICATIONS ⋮ Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros ⋮ A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros ⋮ On the local convergence of Ehrlich method for numerical computation of polynomial zeros ⋮ Dynamic study of Schröder's families of first and second kind ⋮ Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros ⋮ Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials ⋮ On generalized Halley-like methods for solving nonlinear equations ⋮ On a high-order one-parameter family for the simultaneous determination of polynomial roots ⋮ Dynamics and limiting behavior of Julia sets of König's method for multiple roots ⋮ Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method ⋮ A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence ⋮ Convergence of the two-point Weierstrass root-finding method ⋮ Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods ⋮ Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros ⋮ Relationships between different types of initial conditions for simultaneous root finding methods ⋮ On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity ⋮ Sampling algebraic sets in local intrinsic coordinates ⋮ On using symmetric polynomials for constructing root finding methods ⋮ A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously ⋮ Computer visualization and dynamic study of new families of root-solvers ⋮ On a family of Weierstrass-type root-finding methods with accelerated convergence ⋮ The improved Farmer–Loizou method for finding polynomial zeros ⋮ A unified theory of cone metric spaces and its applications to the fixed point theory ⋮ On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros ⋮ 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 ⋮ General convergence theorems for iterative processes and applications to the Weierstrass root-finding method ⋮ Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros ⋮ On the guaranteed convergence of new two-point root-finding methods for polynomial zeros ⋮ On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial ⋮ On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method ⋮ On an efficient simultaneous method for finding polynomial zeros ⋮ Computer tools for the construction and analysis of some efficient root-finding simultaneous methods ⋮ On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
Uses Software
This page was built for publication: Point estimation of root finding methods
