The self-validated method for polynomial zeros of high efficiency

DOI10.1016/J.CAM.2009.09.016MaRDI QIDQ1034672zbMATH OpenOpenAlexFDO

Authors M. S. Petković

Publication date 6 November 2009

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

Full work available at URL https://doi.org/10.1016/j.cam.2009.09.016

zbMATH Keywords

convergenceiterative methodscomputational efficiencyNewton methodcircular interval arithmeticinclusion methodszeros of polynomialsacceleration of convergencecomplex zerosOstrowski's correctionsself-validated method

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04) Algorithms with automatic result verification (65G20)

Recommendations

• scientific article; zbMATH DE number 5353990
• On an efficient simultaneous method for finding polynomial zeros
• scientific article; zbMATH DE number 714514
• Efficient methods for the inclusion of polynomial zeros
• scientific article; zbMATH DE number 440795
• On an efficient inclusion method for finding polynomial zeros
• scientific article; zbMATH DE number 714515
• scientific article; zbMATH DE number 3928210
• scientific article; zbMATH DE number 834504
• On the efficiency of some combined methods for polynomial complex zeros

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 3780477 (Why is no real title available?)
• scientific article; zbMATH DE number 1206066 (Why is no real title available?)
• scientific article; zbMATH DE number 3352737 (Why is no real title available?)
• A modified Newton method for polynomials
• A posteriori error bounds for the zeros of polynomials
• Algorithm 786: multiple-precision complex arithmetic and functions
• An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
• Circular arithmetic and the determination of polynomial zeros
• Computational efficiency of some combined methods for polynomial equations
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• Halley-like method with corrections for the inclusion of polynomial zeros
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• Iterative methods for simultaneous inclusion of polynomial zeros
• Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung
• MPFR
• Numerical methods for roots of polynomials. Part I
• 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
• Parallel Laguerre iterations: The complex case
• Some improved inclusion methods for polynomial roots with Weierstrass' corrections
• Zur iterativen Auflösung algebraischer Gleichungen

Cited in

(6)

• scientific article; zbMATH DE number 5353990 (Why is no real title available?)
• scientific article; zbMATH DE number 714514 (Why is no real title available?)
• Ostrowski-like method with corrections for the inclusion of polynomial zeros
• New higher-order methods for the simultaneous inclusion of polynomial zeros
• The improved Farmer--Loizou method for finding polynomial zeros
• Euler-like method for the simultaneous inclusion of polynomial zeros with Weierstrass' correction

Describes a project that uses

Uses Software

• gmp
• MPFR
• Algorithm 786

This page was built for publication: The self-validated method for polynomial zeros of high efficiency

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