Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with induction
Search options not deleted
user 15045
0
votes
How to estimate a recursive inequality with an upper bound
Here is what I eventually did. In light of @losif's answer which I already accepted, can you please tell me what is wrong with my reasoning below?
Given ($\star$), we have
$$(1+pΔt)A_1+B_1 ≤ A_0 + B_0 …
- 167
3
votes
2
answers
576
views
How to estimate a recursive inequality with an upper bound
The below is a simplification of part of a proof I'm working on, in numerical analysis. It is similar to a paper that I studied some months ago, for which I got some advice here on MathOverflow.
I ha …
- 167