When one does these things by hand, the first step is to divide the exponent by 3 for a cube root (2 for a square root, etc). If more accuracy is needed, then extracting maybe the high-order 4 bits of the mantissa and using that in a lookup table would be sufficient.
Related topics
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| Error Handling for negative real numbers | 34 | 3511 | July 1, 2020 | |
|
CHALLENGE using root_fortran to find root of a complex function
|
39 | 2136 | September 18, 2023 | |
| Working with reals near the machine precision | 35 | 1477 | February 16, 2024 | |
| Fast_math: A collection of functions for fast number crunching using Fortran | 12 | 1256 | October 3, 2023 | |
| Why does squaring generate a different result? | 30 | 1362 | April 19, 2023 |