Computing cube roots when a fast square root is available

DOI10.1016/0898-1221(82)90041-4MaRDI QIDQ1163337zbMATH OpenOpenAlexFDO

Authors Stefan A. Burr

Publication date 1982

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

Full work available at URL https://doi.org/10.1016/0898-1221(82)90041-4

zbMATH Keywords

cube rootsiteration methodsNewton's method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cites work

• An Algorithm for Computing Logarithms and Arctangents
• Ausdehnung des Rombergschen Prinzips
• scientific article; zbMATH DE number 3628385 (Why is no real title available?)
• Iterated Square Root Expansions for the Inverse Cosine and Inverse Hyperbolic Cosine
• Trapezoidal Methods of Approximating Solutions of Differential Equations

Cited in

(1)

• Remarks on Heron's cubic root iteration formula

This page was built for publication: Computing cube roots when a fast square root is available

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