How do we get the approximation?

  • Context: MHB 
  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    Approximation
Click For Summary

Discussion Overview

The discussion revolves around the derivation of the backward Euler method for approximating derivatives in numerical analysis. Participants explore the implications of choosing a negative step size and the iterative process required to estimate values in the context of differential equations.

Discussion Character

  • Technical explanation
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant describes the forward and backward Euler methods and presents the difference quotients used for approximating derivatives.
  • Another participant questions whether it is appropriate to choose a negative step size for $h$ in the backward Euler method.
  • Some participants assert that $h$ should remain positive when approximating the derivative.
  • A later reply suggests an iterative approach to find $y(t^n)$, starting with an initial estimate and refining it using the function $f(t_n, y_n^{[i]})$.

Areas of Agreement / Disagreement

Participants express differing views on the appropriateness of using a negative step size for $h$. There is no consensus on the best approach to derive the backward Euler method or the implications of the choice of $h$.

Contextual Notes

The discussion includes assumptions about the behavior of the function $y(t)$ and the nature of the iterative process, which may not be fully resolved. The dependence on the choice of $h$ and the initial estimates is also noted but remains unclarified.

evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! (Wave)

Approximating $y'(t^n)$ at the relation $y'(t^n)=f(t^n,y(t^n))$ with the difference quotient $\left[\frac{y(t^{n+1})-y(t^n)}{h} \right]$ we get to the Euler method.

Approximating the same derivative with the quotient $\left[\frac{y(t^{n})-y(t^{n-1})}{h} \right]$ we get to the backward Euler method

$$y^{n+1}=y^n+hf(t^{n+1},y^{n+1}), n=0, \dots, N-1$$

where $y^0:=y_0$.
In order to find the formula for the forward Euler method, we use the limit $\lim_{h \to 0} \frac{y(x_0+h)-y(x_0)}{h}$ for $x_0=t^n, h=t^{n+1}-t^n$.
In order to find the formula for the backward Euler method, could we pick $h=t^{n-1}-t^n$ although it is negative?Or how do we get otherwise to the approximation:$$y'(t^n) \approx \frac{y(t^n)-y(t^{n-1})}{h}$$

?
 
Physics news on Phys.org
evinda said:
In order to find the formula for the backward Euler method, could we pick $h=t^{n-1}-t^n$ although it is negative?

Or how do we get otherwise to the approximation:

$$y'(t^n) \approx \frac{y(t^n)-y(t^{n-1})}{h}$$

?

Hi! (Wave)

We should still pick $h$ positive.
I previously explained to http://mathhelpboards.com/members/mathmari/ how to find that derivative in this thread. (Thinking)
 
I like Serena said:
Hi! (Wave)

We should still pick $h$ positive.
I previously explained to http://mathhelpboards.com/members/mathmari/ how to find that derivative in this thread. (Thinking)

Could you explain it further to me? (Thinking)
 
evinda said:
Or how do we get otherwise to the approximation:

$$y'(t^n) \approx \frac{y(t^n)-y(t^{n-1})}{h}$$

?

evinda said:
Could you explain it further to me? (Thinking)

Since we don't know $y(t^n)$ yet, we need to iterate to find it. (Thinking)

We start with an initial estimate:
$$y_n^{[0]} = y(t^{n-1})$$
And then we can iterate with:
$$y_{n}^{[i+1]} = y(t^{n-1}) + h f(t_{n}, y_{n}^{})$$
(Wasntme)
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 38 ·
2
Replies
38
Views
11K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 65 ·
3
Replies
65
Views
8K
Replies
20
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K