Timeline for How to estimate a recursive inequality with an upper bound
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 24, 2018 at 17:54 | history | edited | Cogicero | CC BY-SA 4.0 |
More context, plus comment on my solution
|
| Sep 24, 2018 at 17:51 | answer | added | Cogicero | timeline score: 0 | |
| Sep 14, 2018 at 14:12 | vote | accept | Cogicero | ||
| Sep 14, 2018 at 12:59 | answer | added | Iosif Pinelis | timeline score: 2 | |
| Sep 14, 2018 at 12:04 | comment | added | Cogicero | P.S. I would like to not use an exponential bound such as Gronwall's lemma, if possible, for stability reasons. It is also possible that this can't be proved this way, and I need to start over. But I want to be sure I am not missing something. | |
| Sep 14, 2018 at 11:54 | comment | added | Cogicero | Thank you, I considered that but I hit a snag because of the $p\Delta{t}$ term that exists on the left for $A_n$ but not $B_n$. Any ideas how to approach this? I apologize if I am missing something obvious - I am a self-learner without extensive background in the field. | |
| Sep 14, 2018 at 4:26 | comment | added | Gerhard Paseman | Consider setting Dn = An + Bn, and see what you can say about the sequence D. Gerhard "Fewer Variables Make Things Simpler" Paseman, 2018.09.13. | |
| Sep 14, 2018 at 3:43 | history | asked | Cogicero | CC BY-SA 4.0 |