The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. I: Correction methods

DOI10.1016/J.CAMWA.2007.11.046MaRDI QIDQ1004685zbMATH OpenOpenAlexFDO

Authors M. N. O. Ikhile

Publication date 12 March 2009

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2007.11.046

zbMATH Keywords

interval methodsR-order of convergencecorrectionzeros of a polynomial

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Recommendations

• The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. II: Round-off error analysis by use of interval arithmetic
• Methods with corrections for the simultaneous inclusion of polynomial zeros
• On some simultaneous methods based on Weierstrass' correction
• On the simultaneous improving k inclusion disks for polynomial zeros
• scientific article; zbMATH DE number 794403

Cites work

• scientific article; zbMATH DE number 1694911 (Why is no real title available?)
• scientific article; zbMATH DE number 5130550 (Why is no real title available?)
• scientific article; zbMATH DE number 3707670 (Why is no real title available?)
• scientific article; zbMATH DE number 193463 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 1206066 (Why is no real title available?)
• scientific article; zbMATH DE number 2015316 (Why is no real title available?)
• scientific article; zbMATH DE number 3281219 (Why is no real title available?)
• A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
• An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm)
• Coefficients for studying one-step rational schemes for IVPs in ODEs. I
• Comparing parallel Newton's method with parallel Laguerre's method
• Higher-order simultaneous methods for the determination of polynomial multiple zeros
• Inclusion Weierstrass-like root-finders with corrections
• On The Convergence Of Some Interval Methods For Simultaneous Computation Of Polynomial Zeros
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
• On the R-order of coupled sequences
• On the improved family of simultaneous methods for the inclusion of multiple polynomial zeros
• On the weierstrass and some petkovic-like methods for numerical determination of polynomial zeros
• Ostrowski-like method with corrections for the inclusion of polynomial zeros
• Parallel square-root iterations for multiple roots
• Rates of Convergence for a Class of Iterative Procedures
• Schröder-like algorithms for multiple complex zeros of a polynomial
• Simultaneous inclusion of the zeros of a polynomial
• Some improved inclusion methods for polynomial roots with Weierstrass' corrections

Cited in

(2)

• A class of continuous hybrid linear multistep methods for stiff IVPs in ODEs
• The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. II: Round-off error analysis by use of interval arithmetic

This page was built for publication: The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. I: Correction methods

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