Computing cube roots when a fast square root is available

DOI10.1016/0898-1221(82)90041-4zbMath0483.65028OpenAlexW1983726627MaRDI QIDQ1163337

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

Newton's methoditeration methodscube roots

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Ausdehnung des Rombergschen Prinzips
• Iterated Square Root Expansions for the Inverse Cosine and Inverse Hyperbolic Cosine
• An Algorithm for Computing Logarithms and Arctangents
• Trapezoidal Methods of Approximating Solutions of Differential Equations

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