Timeline for Reference for "trick" on guessing solutions to quadratic recurrences with differential equations
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S May 19 at 10:35 | history | suggested | J. W. Tanner |
Added reference tag
|
|
| May 19 at 2:49 | review | Suggested edits | |||
| S May 19 at 10:35 | |||||
| May 17 at 19:04 | comment | added | Will Sawin | The effectiveness of the trick is not so much due to the recurrence being quadratic, but that it can be written as $g(t) =g(t-1) + f(g(t-1))$ where $f$ takes small values on the domain of interest and these values also change slowly over the domain of interest. | |
| May 17 at 17:05 | comment | added | Will Jagy | I put a bunch of related pdfs at zakuski.math.utsa.edu/~jagy/Iteration.cgi and zakuski.math.utsa.edu/~jagy/ecalle.cgi hosted at a friend's school | |
| May 17 at 16:47 | history | became hot network question | |||
| May 17 at 14:50 | comment | added | Theleb | Your approximation of $g'(h)$ is basically the finite difference approximation, used everywhere in the numerical analysis of ODEs. I would naturally turn to these techniques to study such discrete equations (stability estimates, convergence errors), however I don't know the field your question relates to and the vocabulary/knowledge might be difficult to translate from one to the other. That said, it would probably not be considered as a "good" reference in your field of interest ... | |
| May 17 at 12:52 | answer | added | Alexandre Eremenko | timeline score: 6 | |
| May 17 at 6:23 | history | asked | TiredGradStudent | CC BY-SA 4.0 |