Timeline for accelerating convergence of a class of sequences
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4, 2013 at 9:35 | answer | added | Aaron Meyerowitz | timeline score: 0 | |
| S Jul 3, 2013 at 20:54 | history | bounty ended | James Propp | ||
| S Jul 3, 2013 at 20:54 | history | notice removed | James Propp | ||
| Jul 2, 2013 at 21:38 | vote | accept | James Propp | ||
| Jul 1, 2013 at 20:31 | answer | added | Aaron Meyerowitz | timeline score: 0 | |
| Jun 30, 2013 at 16:16 | comment | added | James Propp | @Noam: In the general case, the almost-periods are irrational numbers, and there could be infinitely many of them. (I am using "almost-periodic" in the sense of H. Bohr.) | |
| Jun 30, 2013 at 6:45 | comment | added | Noam D. Elkies | It would seem that if you know in advance that it's almost periodic with period 2 then you can just use your favorite acceleration technique on the even- and odd-index subsequences separately (and likewise for higher known periods); is there some reason why this won't work for your intended application? | |
| Jun 26, 2013 at 5:44 | answer | added | Michael Renardy | timeline score: 1 | |
| Jun 26, 2013 at 3:25 | comment | added | James Propp | The best I can do with my own customized approach is $O(1/n^2)$. Any $o(1/n^2)$ scheme would be interesting to me, since it would give a new and more accurate way to use rotor-router simulation for quasirandom Monte Carlo. | |
| S Jun 26, 2013 at 3:12 | history | bounty started | James Propp | ||
| S Jun 26, 2013 at 3:12 | history | notice added | James Propp | Draw attention | |
| Jun 20, 2013 at 17:11 | history | asked | James Propp | CC BY-SA 3.0 |