Newton-like algorithms for kth root calculation

DOI10.4064/AP-52-3-303-312zbMATH Open0725.65051OpenAlexW803444488MaRDI QIDQ5203579FDOQ5203579

Authors: Marek Kuczma, Halina Światak 

Publication date: 1991

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

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

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

zbMATH Keywords

Newton methoditerative sequencespeed of convergencekth root calculation

Mathematics Subject Classification ID

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

Cited In (12)

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

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)