Back Euler method for 2nd order d.e

In summary: For the specific system y^4=1/y^2, with y(0)=0,y''(0)=0, the back Euler scheme would be: y_{n+1}=y_{n}+f(y_{n+1}, t_{n+1}).
  • #1
pgioun
5
0
Hi,
How can one use back Euler method for 2nd order d.e?

Is it possible this method to be expanded for a system of 4 odes?

Thanks
 
Physics news on Phys.org
  • #2
pgioun said:
Hi,
How can one use back Euler method for 2nd order d.e?

Write ##dy/dx = p## and ##d^2y/dx^2 = dp/dx##, then solve two first order equations for ##y## and ##p##. (The first equation is your original DE rewritten using ##y##, ##p##, and ##dp/dx##. The second equation is just ##dy/dx = p##).

Is it possible this method to be expanded for a system of 4 odes?
Yes. Just write the 4 variables as a vector, so your equiations become one equation like $$\frac{d}{dx}\begin{pmatrix}y_1 \\ y_2 \\ y_3 \\ y_4\end{pmatrix} = f\begin{pmatrix}y_1 \\ y_2 \\ y_3 \\ y_4\end{pmatrix} + g(x)$$
 
  • #3
AlephZero said:
Write ##dy/dx = p## and ##d^2y/dx^2 = dp/dx##, then solve two first order equations for ##y## and ##p##. (The first equation is your original DE rewritten using ##y##, ##p##, and ##dp/dx##. The second equation is just ##dy/dx = p##).


Yes. Just write the 4 variables as a vector, so your equiations become one equation like $$\frac{d}{dx}\begin{pmatrix}y_1 \\ y_2 \\ y_3 \\ y_4\end{pmatrix} = f\begin{pmatrix}y_1 \\ y_2 \\ y_3 \\ y_4\end{pmatrix} + g(x)$$

Ok.. and then how the back Euler scheme will be like..?
If it was one ode it would be: [itex]y_{n+1}[/itex]=[itex]y_{n}[/itex]+f( [itex]y_{n+1}[/itex], [itex]t_{n+1}[/itex]).
To be more specific I want to solve the system:[itex]y^{4}[/itex]=1/[itex]y^{2}[/itex], with y(0)=0,y''(0)=0, applying this method..
Thanks.
 
  • #4
pgioun said:
Ok.. and then how the back Euler scheme will be like..?

It looks exactly the same. Just replace the scalar y with the vector.
 
  • #5
for your question. The back Euler method is a numerical method used to approximate solutions to ordinary differential equations (ODEs). It is a type of implicit method, meaning that the solution at a given time step is dependent on the solution at the previous time step. This method is particularly useful for stiff ODEs, where the solution changes rapidly over a small interval of time.

To use the back Euler method for a second order ODE, we first need to rewrite the equation as a system of first order ODEs. This can be done by introducing a new variable to represent the derivative of the original variable. For example, if we have the second order ODE y'' = f(x,y,y'), we can rewrite it as a system of first order ODEs: y' = z and z' = f(x,y,z). We can then use the back Euler method to approximate the solution for both y and z at each time step.

As for your second question, it is possible to expand the back Euler method to solve a system of four ODEs. The process would be the same as for a second order ODE - rewrite the system as a system of first order ODEs and use the back Euler method to approximate the solutions for each variable at each time step. However, it is important to note that the accuracy of the method may decrease as the number of equations increases, so it is important to consider other numerical methods as well.
 

1. What is the Back Euler method for 2nd order differential equations?

The Back Euler method is a numerical method used to approximate the solution of a 2nd order differential equation. It is a type of implicit method, meaning that the solution at the next time step is calculated using the solution at the current time step.

2. How does the Back Euler method work?

The Back Euler method involves using the derivative of the function at the next time step to approximate the value of the function at that time step. This is done by taking a small time step and using the derivative to calculate the slope of the curve at that point, and then using that slope to estimate the value of the function at the next time step.

3. What are the advantages of using the Back Euler method for 2nd order differential equations?

One advantage of the Back Euler method is that it is unconditionally stable, meaning that it will produce a solution regardless of the size of the time step. It is also relatively easy to implement and can handle stiff equations, which are equations that have rapidly changing solutions.

4. Are there any limitations to using the Back Euler method?

One limitation of the Back Euler method is that it is only accurate up to first order, meaning that the error in the approximation will decrease linearly with the size of the time step. It also requires knowledge of the derivative of the function, which may not always be readily available.

5. How does the Back Euler method compare to other numerical methods for 2nd order differential equations?

The Back Euler method is generally less accurate than more advanced methods, such as the Runge-Kutta method. However, it is more stable and easier to implement. The choice of which method to use will depend on the specific needs and constraints of the problem at hand.

Similar threads

Replies
7
Views
2K
  • Differential Equations
Replies
7
Views
2K
  • Differential Equations
Replies
5
Views
1K
Replies
2
Views
4K
  • Differential Equations
Replies
4
Views
1K
  • Differential Equations
Replies
11
Views
20K
Replies
16
Views
2K
  • Differential Equations
Replies
5
Views
2K
  • Differential Equations
Replies
5
Views
4K
Replies
2
Views
986
Back
Top