Newton-like algorithms for kth root calculation

DOI10.4064/AP-52-3-303-312MaRDI QIDQ5203579zbMATH OpenOpenAlexFDO

Authors Marek Kuczma, Halina Światak

Publication date 1991

Published in Annales Polonici Mathematici (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4064/ap-52-3-303-312

zbMATH Keywords

iterative sequencekth root calculationNewton methodspeed of convergence

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)

Recommendations

• Newton's method and high-order algorithms for the \(n\)th root computation
• scientific article; zbMATH DE number 3938453
• Fast computation of the Nth root
• scientific article; zbMATH DE number 2053005
• On two sequences of algorithms for approximating square roots

Cited in

(12)

• Fast computation of the Nth root
• A bounding approach to calculating \(\alpha ^{1/p}\)
• Newton's method and high-order algorithms for the \(n\)th root computation
• Integer roots for integer-power-content calculations
• On Rational Function Approximations to Square Roots
• An algorithm to compute integer th roots using subtractions
• scientific article; zbMATH DE number 3880014 (Why is no real title available?)
• Short Notes: Rapidly Converging Iterative Formulae for Finding Square Roots and their Computational Efficiencies
• On K nig's root-finding algorithms*
• scientific article; zbMATH DE number 2053005 (Why is no real title available?)
• A New Root–Finding Algorithm Using Exponential Series
• High-order convergence of the k-fold pseudo-Newton's irrational method locating a simple real zero

This page was built for publication: Newton-like algorithms for kth root calculation

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