Back to Topic 5.16 — Euler's method (1st order) (HL only)
5.16.1Math AI HL8 flashcards

Euler's method (1st order)

Practice Flashcards

Flip to reveal answers
Card 1 of 85.16.1
5.16.1
Question

What is the Euler recurrence for dy/dx = f(x, y)?

Click to reveal answer

Track your progress — Sign up free to save your progress and get smart review reminders based on spaced repetition.

All 8 Flashcards — Euler's method (1st order)

Sign up free to track progress and get spaced-repetition review schedules.

Card 1formula

Question

What is the Euler recurrence for dy/dx = f(x, y)?

Answer

y_(n+1) = y_n + h·f(x_n, y_n) and x_(n+1) = x_n + h, starting from (x₀, y₀).

Card 2formula

Question

How many Euler steps reach a target x from x₀ with step length h?

Answer

number of steps = (target − x₀) ÷ h. E.g. x = 1 to x = 2 with h = 0.25 is 4 steps.

Card 3concept

Question

What does each Euler step actually do geometrically?

Answer

It moves along a short STRAIGHT line at the gradient measured at the current point — so the path only approximates the true curve.

Card 4concept

Question

Is Euler's method exact?

Answer

No — it is an approximation. A smaller step length h gives more steps and a more accurate estimate, but never the exact value.

Card 5concept

Question

Does Euler over- or under-estimate?

Answer

It depends on the curve's concavity: it tends to UNDER-estimate for a concave-up curve and OVER-estimate for a concave-down curve.

Card 6concept

Question

Which gradient does each Euler step use?

Answer

The gradient f(xₙ, yₙ) at the START of the step (the point you are currently at), not at the new point.

Card 7formula

Question

How do you find the percentage error of an Euler estimate?

Answer

percentage error = |approx − exact| ÷ exact × 100%, using the exact solution given in the question.

Card 8concept

Question

What is the GDC route for Euler's method in AI?

Answer

Store the recurrence as a recursive sequence (or fill a table of n, xₙ, yₙ, gradient); a calculator is allowed on every AI paper.

Track your progress with spaced repetition

Sign up free — Aimnova tells you exactly which cards to review and when, so you remember everything before your IB exam.

Start Free
IB Math AI Euler's method (1st order) Flashcards | 5.16.1 | Aimnova | Aimnova