High order algorithms for calculating roots

DOI10.1017/MAG.2016.106MaRDI QIDQ5367033zbMATH OpenOpenAlexFDO

Authors Ulrich Abel

Publication date 12 October 2017

Published in The Mathematical Gazette (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/mag.2016.106

zbMATH Keywords

Hirschhorn's algorithmsHouseholder's methodSchröder's method

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Recommendations

• High order algorithms for approximatingnth roots
• Newton's method and high-order algorithms for the \(n\)th root computation
• High order iterative methods for approximating square roots
• Fixed point and Newton's methods for solving a nonlinear equation: from linear to high-order convergence
• Higher order two-step methods for root finding

Cites work

• Comparison of iterative methods for the calculation of n th roots
• scientific article; zbMATH DE number 3369646 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• scientific article; zbMATH DE number 3082021 (Why is no real title available?)

Cited in

(7)

• Newton's method and high-order algorithms for the \(n\)th root computation
• Algorithms for \(n\)-th root approximation.
• Calculating formulas and convergence of roots for equation of 5th order
• scientific article; zbMATH DE number 3945258 (Why is no real title available?)
• Calculating the square root with arbitrary order of convergence
• High order algorithms for approximatingnth roots
• A note on machine method for root extraction

This page was built for publication: High order algorithms for calculating roots

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