On the efficiency of some combined methods for polynomial complex zeros

DOI10.1016/0377-0427(90)90009-OzbMath0696.65041OpenAlexW2093317929MaRDI QIDQ911229

Miodrag S. Petković

Publication date: 1990

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(90)90009-o

zbMATH Keywords

algorithmconvergencenumerical examplesinterval arithmeticcomputational efficiencyinterval methodscircular interval arithmeticsimultaneous iterative methodsinclusion of polynomial zeroscomplex zeros of a polynomialpoint-complex arithmetic

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) 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 (4)

On iteration methods without derivatives for the simultaneous determination of polynomial zeros ⋮ Higher-order iterative methods for approximating zeros of analytic functions ⋮ Schröder-like algorithms for multiple complex zeros of a polynomial ⋮ A hybrid method for polynomial complex zero

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The numerical stability of the generalised root iterations for polynomial zeros
• A family of root finding methods
• The numerical stability of simultaneous iterations via square-rooting
• Iterative methods for simultaneous inclusion of polynomial zeros
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• Circular arithmetic and the determination of polynomial zeros
• Zur iterativen Auflösung algebraischer Gleichungen
• On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
• On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• Iterative methods for interval inclusion of fixed points
• An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
• A modified Newton method for polynomials
• On the number of multiplications necessary to compute certain functions

This page was built for publication: On the efficiency of some combined methods for polynomial complex zeros