Timeline for Is there any numerical technique to sum x^(n^alpha), n=0,1,...?
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 18, 2010 at 14:21 | vote | accept | MarkV | ||
| Mar 17, 2010 at 19:55 | comment | added | MarkV | Unfortunately, the case I'm interested in is 1/2 < alpha < 1, so the series converges pretty slowly. Thank you for posting these links and this great review paper, I will try this. | |
| Mar 17, 2010 at 19:12 | comment | added | Jonas Meyer | I thought so. I wouldn't mind all comments referring to it being deleted for posterity, but if I only delete mine it may be confusing. | |
| Mar 17, 2010 at 18:53 | comment | added | Jacques Carette | Yep, that $n\geq 2$ was a simple mistake [I had too many variants of the equation in my Maple session where I 'played around' with it first before posting my answer. Error edited away, thanks] | |
| Mar 17, 2010 at 18:51 | history | edited | Jacques Carette | CC BY-SA 2.5 |
oops
|
| Mar 17, 2010 at 18:24 | comment | added | Harald Hanche-Olsen | @Jonas: I bet that's just a slip o' ye olde keyboard and shouldn't have been there. The answer seems to make good sense if you just delete it. | |
| Mar 17, 2010 at 18:19 | comment | added | Harald Hanche-Olsen | And note the reference to the extensive review paper arxiv.org/abs/math/0005209 found in the second link above. | |
| Mar 17, 2010 at 18:17 | comment | added | Jonas Meyer | What do you mean by "For $n\geq2$"? | |
| Mar 17, 2010 at 17:00 | history | answered | Jacques Carette | CC BY-SA 2.5 |