Timeline for Lower bounds for finite difference formulas
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 9, 2017 at 2:04 | vote | accept | amakelov | ||
| Feb 9, 2017 at 2:04 | vote | accept | amakelov | ||
| Feb 9, 2017 at 2:04 | |||||
| Feb 7, 2017 at 21:05 | answer | added | David Ketcheson | timeline score: 2 | |
| Feb 7, 2017 at 1:05 | comment | added | VorKir | Are you trying to create a procedure for generating finite difference formula for arbitrary order of accuracy? The lower bounds come from considering a linear system which represent approximation conditions for a linear combination of values of $f$ with unknown coefficients. Your question reduces then to the question when the system has at least one solution. In simplest case of uniform mesh and arbitrary smooth $f$, $\Omega(k) \geq k + 1$ if you want at least 1st order of approximation. | |
| Feb 6, 2017 at 23:11 | history | asked | amakelov | CC BY-SA 3.0 |