One method consists in computing the numerical solution for an arbitrary h and then 2h. The Richardson extrapolation gives an estimate of e=maxt|y(t,2h)−y(t,h)| of the error. When the error is smaller than the tolerance, we keep the result and start from 2y(t,h)−y(t,h). If the error is larger we restart with h/2 until we reach the tolerance.

sublimnes9 2022-08-07 Answered
One method consists in computing the numerical solution for an arbitrary h and then 2 h. The Richardson extrapolation gives an estimate of e = max t | y ( t , 2 h ) y ( t , h ) | of the error. When the error is smaller than the tolerance, we keep the result and start from 2 y ( t , h ) y ( t , h ). If the error is larger we restart with h / 2 until we reach the tolerance.
( y ( t , 2 h ) means approximation with 2 h)
I don't understand why the Richardson extrapolation is mentioned. For what do I have to use it? Can I not just calculate y ( t , 2 h ) and y ( t , h ) and see the error?
You can still ask an expert for help

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

raffatoaq
Answered 2022-08-08 Author has 22 answers
You can just check the error, and not bother with Richardson extrapolation, that's fine. But once you've paid the computational price of calculating the error, you might as well use Richardson extrapolation to blackuce the error further; it costs you essentially nothing.
Not exactly what you’re looking for?
Ask My Question

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

You might be interested in

asked 2022-08-12
How does the Velocity Verlet method differ from the standard Euler method? Why do we need to add Acceleration / 2 to calculate position?
asked 2022-08-14
y = 11 y
y ( 2 ) = 1 ; y ( 2 ) = 4
and asked to use Euler's method to find y ( 2.2 ) for h = 0.1
To find y I simply took the integral of y to get:
y = 11 x y x
However, this does not satisfy the condition given above, that y ( 2 ) = 4. Is this not the correct way of obtaining the first order derivative?
asked 2022-07-16
Y = A Y
A = [ 1 2 1 1 0 1 4 4 5 ]
Y ( 0 ) = ( 1 0 0 )
I have to solve this system using Eulers method, but what's Eulers method, like I know how to approach this using the eigenvalue method, but the problem explicitly states that it has to be solved using that method, yet my textbook doesn't provide an algorithm for such a method.
asked 2022-07-21
I'm asked to decide if I should solve the system
y ˙ = ( 600 400 400 600 ) y , t [ t 0 , t e ] , y ( t 0 ) = y 0
with either the explicit Euler method or the implicit Euler method.

Using the explicit Euler method I would get the updating scheme
y n + 1 = ( 1 600 h 400 h 400 h 1 600 h ) y n
where the eigenvalues of the driving matrix is
λ 1 = 401 600 h ,
λ 2 = 399 600 h .
For the solution to be stable these need to be less than one which gives the conditions
h 4 6 = 2 3 ,
h 4 6 = 2 3 .
The last condition doesn't say anything but the first condition seems restrictive since I can't choose h as small as possible.

If I instead were to use the implicit Euler method I would get the updating scheme
y n + 1 = ( 1 600 h 400 h 400 h 1 600 h ) 1 y n .
Now I can't solve for the eigenvalues of this system but I've heard the implicit Euler is unconditionally stable so it shouldn't matter.

So is the answer that I should choose implicit Euler because it is unconditionally stable or am I missing something? The order of consistency of both is 1 so that should not matter.
asked 2022-08-13
I am attempting to compute an approximation of the solution with the forward Euler method in [ 0 , 1 ] with step lengths h 1 = 0.2, h 2 = 0.1 given the initial value problem below
d y d z = 1 1 + z y ( z ) y ( 0 ) = 1
I am not sure what to do when I am given two step sizes instead of one. I know how to compute it if it was given with a step size. Am I supposed to find out the approximation for two different step sizes? Or is there anything I am missing?
asked 2022-06-13

I am revising the modified euler method and would appreciate some help with this question:
The equation is
y  = 2 x y + x 2 e x , y ( 1 ) = 0
Use modified euler method to calculate y ( 1.1 ) taking h = 0.1 (working to 4 decimal places)
Where do i start?

asked 2022-07-16
I need to solve the equation below with Euler's method:
y + π y e x / 3 ( 2 y sin ( π x ) + π y cos ( π x ) ) = y 9
for the initial conditions y ( 0 ) = 1, y ( 0 ) = 1 / 3
So I know I need to turn the problem into a system of two first order differential equations.
Therefore u 1 = y and u 2 = y I can now write the system as:
u 1 = y u 2 = y 9 π y e x / 3 ( 2 u 1 sin ( π x ) π y cos ( π x ) )
How do I proceed from here?