Modified Newton method in circular interval arithmetic
From MaRDI portal
Publication:1904962
DOI10.1007/BF02193468zbMath0836.65069MaRDI QIDQ1904962
Publication date: 6 February 1996
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
convergenceparallel algorithmmultiple rootsinterval methodpolynomial rootsmodified Newton methodcomplex circular interval arithmetic
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Locating multiple zeros interactively
- On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
- A parallel Wilf algorithm for complex zeros of a polynomial
- A method for computing a root of a single nonlinear equation, including its multiplicity
- Parallel Laguerre iterations: The complex case
- Iterative methods for simultaneous inclusion of polynomial zeros
- Upperbounds for roots of polynomials
- Circular arithmetic and the determination of polynomial zeros
- Simultaneous inclusion of the zeros of a polynomial
- A Machine Method for Solving Polynomial Equations
- A Globally Convergent Method for Simultaneously Finding Polynomial Roots
- On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
- An Existence Test for Root Clusters and Multiple Roots
- An algorithm for the total, or partial, factorization of a polynomial
- A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- Analytic Inequalities
- On Lehmer's Method for Finding the Zeros of a Polynomial
This page was built for publication: Modified Newton method in circular interval arithmetic
