On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
From MaRDI portal
Publication:1146966
DOI10.1007/BF02243437zbMath0448.65021OpenAlexW287601386MaRDI QIDQ1146966
Publication date: 1981
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02243437
order of convergencecircular interval arithmeticroot iterationscomplex zeros of a polynomialaccelerating the convergenceparallel interval methods
Interval and finite arithmetic (65G30) Extrapolation to the limit, deferred corrections (65B05) 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)
Related Items
Laguerre-like inclusion method for polynomial zeros, Error-bounds for zeroes of polynomials using complex circular arithmetic, Modified Newton method in circular interval arithmetic, Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros, On the k-th root in circular arithmetic, On initial conditions for the convergence of simultaneous root finding methods, Point estimation and some applications to iterative methods, New higher-order methods for the simultaneous inclusion of polynomial zeros, On an iterative method for simultaneous inclusion of polynomial complex zeros, On the convergence condition of generalized root iterations for the inclusion of polynomial zeros, A family of root-finding methods with accelerated convergence, Efficient methods for the inclusion of polynomial zeros, On some improvements of square root iteration for polynomial complex zeros, Schröder-like algorithms for multiple complex zeros of a polynomial, On some iteration functions for the simultaneous computation of multiple complex polynomial zeros, On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros, On the convergence order of accelerated root iterations, The numerical stability of the generalised root iterations for polynomial zeros, A family of simultaneous methods for the determination of polynomial complex zeros, On a second order method for the simultaneous inclusion of polynomial complex zeros in rectangular arithmetic
Cites Work
- Parallel Laguerre iterations: The complex case
- Una famiglia di metodi iterativi per ogni ordine superiore al secondo
- Circular arithmetic and the determination of polynomial zeros
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- A modified Newton method for polynomials
- Certain modifications of Newton's method for the approximate solution of algebraic equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
