Algorithms for n-th root approximation.

DOI10.1007/BF02252255MaRDI QIDQ2564995zbMATH OpenOpenAlexFDO

Authors F. Dubeau

Publication date 1996

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02252255

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Recommendations

• High order algorithms for approximatingnth roots
• Algorithms for the matrix \(p\)th root
• An efficient algorithm for the complex roots problem
• High order algorithms for calculating roots
• scientific article; zbMATH DE number 3872575
• scientific article; zbMATH DE number 3909639
• Newton's method and high-order algorithms for the \(n\)th root computation

Cites work

• Accelerated Convergence in Newton’s Method
• An Iterative Method for Approximating Square Roots
• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 3302906 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• On two sequences of algorithms for approximating square roots

Cited in

(8)

• nth root extraction: Double iteration process and Newton's method
• Accelerated convergence in Newton's method for approximating square roots
• New methods for approximating square roots
• Newton's method and high-order algorithms for the \(n\)th root computation
• Inverse function, Taylor's expansion and extended Schröder's processes
• scientific article; zbMATH DE number 3880014 (Why is no real title available?)
• On K nig's root-finding algorithms*
• Methods with prefixed order for approximating square roots with global and general convergence

This page was built for publication: Algorithms for \(n\)-th root approximation.

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