On the efficiency of some combined methods for polynomial complex zeros

DOI10.1016/0377-0427(90)90009-OMaRDI QIDQ911229zbMATH OpenOpenAlexFDO

Authors M. 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

convergencenumerical examplesalgorithmcomputational efficiencyinterval arithmeticcircular interval arithmeticinterval methodssimultaneous iterative methodsinclusion of polynomial zeroscomplex zeros of a polynomialpoint-complex arithmetic

Mathematics Subject Classification ID

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

Recommendations

• Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic
• Computational efficiency of some combined methods for polynomial equations
• Improved methods for the simultaneous inclusion of multiple polynomial zeros
• A new simultaneous method of fourth order for finding complex zeros in circular interval arithmetic
• A hybrid method for polynomial complex zero

Cites work

• scientific article; zbMATH DE number 3890621 (Why is no real title available?)
• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• scientific article; zbMATH DE number 3942922 (Why is no real title available?)
• scientific article; zbMATH DE number 3679069 (Why is no real title available?)
• scientific article; zbMATH DE number 3684883 (Why is no real title available?)
• scientific article; zbMATH DE number 3435009 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• A family of root finding methods
• A modified Newton method for polynomials
• An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
• Circular arithmetic and the determination of polynomial zeros
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• Iterative methods for interval inclusion of fixed points
• Iterative methods for simultaneous inclusion of polynomial zeros
• On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
• On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
• On the number of multiplications necessary to compute certain functions
• The numerical stability of simultaneous iterations via square-rooting
• The numerical stability of the generalised root iterations for polynomial zeros
• Zur iterativen Auflösung algebraischer Gleichungen

Cited in

(6)

• Schröder-like algorithms for multiple complex zeros of a polynomial
• A hybrid method for polynomial complex zero
• On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
• Higher-order iterative methods for approximating zeros of analytic functions
• The self-validated method for polynomial zeros of high efficiency
• On iteration methods without derivatives for the simultaneous determination of polynomial zeros

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911229)