Euler's Method Error: Linear Functions

In summary, Euler's Method is a numerical method used to approximate solutions to differential equations by dividing the solution interval into smaller subintervals and using the slope of the tangent line at each point to calculate the next point on the solution curve. The error associated with this method for linear functions is O(h), where h is the step size, and it can be improved by decreasing the step size or using a more accurate method such as Runge-Kutta. It can also be used for non-linear functions, but with a potentially larger error. However, Euler's Method has limitations, such as providing inaccurate solutions for non-linear functions, requiring a lot of computational resources, and not being suitable for large intervals or functions with discontinuities.
  • #1
evinda
Gold Member
MHB
3,836
0
Hello! (Smile)

Theorem: Let $f \in C([a,b] \times \mathbb{R})$ function that satifies the total Lipschitz condition and let $y \in C^2([a,b])$ the solution of the ODE $\left\{\begin{matrix}
y=f(t,y(t)) &, a \leq t \leq b \\
y(a)=y_0 &
\end{matrix}\right.$
If $y^0, y^1, \dots, y^N$ are the approximations of Euler's method for uniform partition with step $h=\frac{b-a}{N}$ then

$$\max_{0 \leq n \leq N} |y(t^n)-y^n| \leq \frac{M}{2L}(e^{L(b-a)}-1)h$$

where $M=\max_{a \leq t \leq b} |y''(t)|$.

Then there is the following remark:

$$y'=1, 0 \leq t \leq 1 \\ y(0)=0 \\ y(t)=t $$

When the function is linear, there is no error.Can we justify as follows?Suppose that we have a linear function $y(t)=at+b$.
Then $y'(t)=a$ and $y''(t)=0$
So $M=0$ and thus $\max_{0 \leq n \leq N} |y(t^n)-y^n| \leq 0 \Rightarrow \max_{0 \leq n \leq N} |y(t^n)-y^n|=0$.
Also don't we always have a uniform partition at Euler's method? (Thinking)
 
Mathematics news on Phys.org
  • #2


Hello there! It is great to see someone interested in numerical methods for solving ODEs. Your reasoning is partially correct, but there are a few points that need clarification.

Firstly, it is important to note that the theorem you have stated is for a general function $f$, not just linear functions. So while it may be true that for a linear function $y(t)=at+b$, the error is zero, this does not necessarily hold for all functions.

Secondly, the linear function $y(t)=at+b$ does not satisfy the total Lipschitz condition, as it is not a Lipschitz continuous function. Therefore, the theorem cannot be applied to this case.

Lastly, it is true that Euler's method uses a uniform partition, but this does not necessarily mean that the function being approximated is linear. The error in Euler's method depends on the function itself, not just the partition used.

In conclusion, while it is true that for a linear function $y(t)=at+b$, the error in Euler's method is zero, this does not hold for all functions. The theorem you have stated is a general result for any function satisfying the total Lipschitz condition, and it is not limited to just linear functions. I hope this helps clarify things for you. Happy researching!
 

FAQ: Euler's Method Error: Linear Functions

What is Euler's Method and how is it used to approximate solutions to differential equations?

Euler's Method is a numerical method used to approximate solutions to ordinary differential equations. It involves dividing the interval of the solution into smaller subintervals and using the slope of the tangent line at each point to calculate the next point on the solution curve. This process is repeated until the desired level of accuracy is achieved.

What is the error associated with Euler's Method for linear functions?

The error associated with Euler's Method for linear functions is O(h), where h is the step size used in the method. This means that as the step size decreases, the error also decreases.

Can Euler's Method be used to approximate solutions for non-linear functions?

Yes, Euler's Method can be used for non-linear functions. However, the error associated with the method may be larger for non-linear functions compared to linear functions.

How can the accuracy of Euler's Method for linear functions be improved?

The accuracy of Euler's Method for linear functions can be improved by decreasing the step size h. This means dividing the interval into more subintervals and calculating more points on the solution curve. Additionally, using a more accurate method such as the Runge-Kutta method can also improve the accuracy.

What are the limitations of using Euler's Method for approximating solutions to differential equations?

Euler's Method may not provide accurate solutions for all types of differential equations, especially for non-linear functions. It also requires a lot of computational resources as the number of subintervals increases. Additionally, it may not be suitable for approximating solutions for large intervals or for functions with discontinuities.

Similar threads

Replies
1
Views
2K
Replies
1
Views
2K
Replies
1
Views
1K
Replies
1
Views
1K
Replies
1
Views
1K
Replies
2
Views
1K
Back
Top