Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials

DOI10.1137/0715032zbMath0384.65020MaRDI QIDQ4164726

Irene Gargantini

Publication date: 1978

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0715032

Mathematics Subject Classification ID

65H05: Numerical computation of solutions to single equations

30C10: Polynomials and rational functions of one complex variable

Related Items

On the construction of simultaneous methods for multiple zeros, Some higher-order methods for the simultaneous approximation of multiple polynomial zeros, Improved methods for the simultaneous inclusion of multiple polynomial zeros, On an efficient inclusion method for finding polynomial zeros, Traub's accelerating generator of iterative root-finding methods, Efficient methods for the inclusion of polynomial zeros, A new higher-order family of inclusion zero-finding methods, New higher-order methods for the simultaneous inclusion of polynomial zeros, Schröder-like algorithms for multiple complex zeros of a polynomial, A hybrid method for polynomial complex zero, The numerical stability of the generalised root iterations for polynomial zeros, A modified Newton method in parallel circular iteration of single-step and double-step, On the efficiency of some combined methods for polynomial complex zeros, On the convergence condition of generalized root iterations for the inclusion of polynomial zeros, Chebyshev-Halley methods for analytic functions, The self-validated method for polynomial zeros of high efficiency, On a second order method for the simultaneous inclusion of polynomial complex zeros in rectangular arithmetic, Error-bounds for zeroes of polynomials using complex circular arithmetic, Some interval iterations for finding a zero of a polynomial with error bounds, Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros, A computational test for the existence of a polynomial zero, A family of simultaneous zero-finding methods, Parallel square-root iterations for multiple roots, On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic, On an iterative method for simultaneous inclusion of polynomial complex zeros, Higher-order iterative methods for approximating zeros of analytic functions, On the \(R\)-order of some accelerated methods for the simultaneous finding of polynomial zeros, The numerical stability of simultaneous iterations via square-rooting, Forms for meromorphic functions, On the convergence of Wang-Zheng's method, An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction, On the simultaneous determination of the zeros of an analytic function inside a simple smooth closed contour in the complex plane, Point estimation and some applications to iterative methods, The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros, Laguerre-like inclusion method for polynomial zeros, Family of simultaneous methods of Hansen--Patrick's type, Modified Newton method in circular interval arithmetic, Point estimation of simultaneous methods for solving polynomial equations: A survey. II., Derivative free inclusion methods for polynomial zeros, A higher order family for the simultaneous inclusion of multiple zeros of polynomials, On the convergent condition of Newton-like method in parallel circular iteration for simultaneously finding all multiple zeros of a polynomial. II, On the convergent condition of Newton-like method in parallel circular iteration for simultaneously finding all multiple zeros of a polynomial, On The Convergence Of Some Interval Methods For Simultaneous Computation Of Polynomial Zeros, A family of simultaneous methods for the determination of polynomial complex zeros, A family of simultaneous zero finding methods