Timeline for Difficulty when trying to find roots to high accuracy
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 28, 2020 at 19:01 | comment | added | Daniel Lichtblau | I wonder if evaluating 'f' in fixed precision might be better? | |
| Aug 28, 2020 at 13:25 | history | edited | Michael E2 | CC BY-SA 4.0 |
Added addendum
|
| Aug 28, 2020 at 6:51 | vote | accept | David | ||
| Aug 28, 2020 at 4:39 | history | edited | Michael E2 | CC BY-SA 4.0 |
Responded to comment
|
| Aug 28, 2020 at 4:39 | comment | added | Michael E2 |
@David Thanks, you're question gave me another idea. But see what happens to the precision when you execute NestList[f[#, l[8]] &, 1/2, 2^8]. The precision is reduced as f is nested.
|
|
| Aug 28, 2020 at 3:34 | comment | added | David | Fantastic, thank you. Do you know what's causing a numerical overflow in the lower precision case? It seems like it should be doable without such a high working precision. | |
| Aug 28, 2020 at 2:31 | history | answered | Michael E2 | CC BY-SA 4.0 |