Opening your learning space
Starting the app …
Opening your learning space
Starting the app …
The forward Euler method approximates a solution of y′=f(t,y) by extending the tangent slope as constant over a step h.
Free to browse · flashcards or a multiple-choice quiz · import from Essential
Formula
h has the units of t; h·f has the same units as y.
| Symbol | Meaning | Unit |
|---|---|---|
| Approximation at time tn | unit of y | |
| Time step | unit of t | |
| Slope from the differential equation | y per t | |
| Current time | unit of t |
y_{n+1}=y_n+h\,f(t_n,y_n)Under smoothness conditions, the method has global error order O(h) and is simple, but may be unstable for large steps. Results depend on step size and the stability region; check accuracy through step-size comparison and suitable error control. It is not a replacement for an exact solution when one is available.
Under smoothness conditions, the method has global error order O(h) and is simple, but may be unstable for large steps. Results depend on step size and the stability region; check accuracy through step-size comparison and suitable error control. It is not a replacement for an exact solution when one is available.
The forward Euler method approximates a solution of y′=f(t,y) by extending the tangent slope as constant over a step h.
Recover slope from two approximations
A local slope, not the exact mean slope across the step.
Rework the example for “Forward Euler Method” and explain why the check is valid.
For y′=y, y(0)=1, h=0.1: y1=1+0.1·1=1.1.
The exact value is e0·1≈1.10517; error ≈0.00517.
Check: the error typically decreases linearly when h is reduced.
Ignoring an assumption of the formula: Under smoothness conditions, the method has global error order O(h) and is simple, but may be unstable for large steps
Check units and model conditions before substitution; then verify the result in the original relation or a limiting case.
Formula cluster
Related relations in the formula sheet: trennbare-differentialgleichung, lineare-differentialgleichung-erster-ordnung, lineare-differentialgleichung-zweiter-ordnung.
For y′=y, y(0)=1, h=0.1: y1=1+0.1·1=1.1. The exact value is e0·1≈1.10517; error ≈0.00517. Check: the error typically decreases linearly when h is reduced.
Numerically solve initial-value problems when closed-form solutions are unavailable or inconvenient.
Here is how to work through a typical Forward Euler Method (yₙ₊₁=yₙ+h·f(tₙ,yₙ)) task step by step:
Task
Rework the example for “Forward Euler Method” and explain why the check is valid.
Solution path
For y′=y, y(0)=1, h=0.1: y1=1+0.1·1=1.1.
The exact value is e0·1≈1.10517; error ≈0.00517.
Check: the error typically decreases linearly when h is reduced.
The forward Euler method approximates a solution of y′=f(t,y) by extending the tangent slope as constant over a step h. The notation yn+1=yn+h·f(tn,yn) shows which quantities are connected. Here, yn: Approximation at time tn (unit of y); h: Time step (unit of t); f(tn,yn): Slope from the differential equation (y per t). h has the units of t; h·f has the same units as y. An application depends on whether the supplied quantities match the definitions and reference directions. Common uses include Numerically solve initial-value problems when closed-form solutions are unavailable or inconvenient.. Read the variables and their dimensions before substituting numbers; this often reveals whether the result should be a length, rate, probability, or dimensionless statistic.
Start with a diagram or a list of known quantities, assign each one a symbol, and convert units to a consistent form. Then choose the appropriate equation and substitute values only afterward. Example: For y′=y, y(0)=1, h=0.1: y1=1+0.1·1=1.1. The exact value is e0·1≈1.10517; error ≈0.00517. Check: the error typically decreases linearly when h is reduced. Verification is part of the calculation: Under smoothness conditions, the method has global error order O(h) and is simple, but may be unstable for large steps Also compare the magnitude and unit with the context. Round only at the end, since early rounding can affect multi-step calculations, especially when small differences or sums are involved.
Under smoothness conditions, the method has global error order O(h) and is simple, but may be unstable for large steps. Results depend on step size and the stability region; check accuracy through step-size comparison and suitable error control. It is not a replacement for an exact solution when one is available. These are not minor footnotes: when assumptions fail, the formula can produce a precise but inappropriate result. Before calculating, identify which values are observed, estimated, or modeled, and whether special cases change the equation. Numerically solve initial-value problems when closed-form solutions are unavailable or inconvenient. For numerical methods, also check step size and stability; for statistics, sampling design and distribution; for calculus, differentiability, boundary, and orientation. Use another method when these conditions do not hold.
Both relations belong to the same topic, but answer different questions. “Forward Euler Method”: The forward Euler method approximates a solution of y′=f(t,y) by extending the tangent slope as constant over a step h. The companion relation “Separable Differential Equation” For a separable differential equation, all y-terms and x-terms can be moved to separate sides and integrated. Choose based on the quantity sought and the model: Numerically solve initial-value problems when closed-form solutions are unavailable or inconvenient. The worked example For y′=y, y(0)=1, h=0.1: y1=1+0.1·1=1.1. The exact value is e0·1≈1.10517; error ≈0.00517. Check: the error typically decreases linearly when h is reduced. shows which quantities actually enter this relation. Compare both formulas using the same data and identify the companion’s extra assumption. This clarifies which relation fits.
For an ODE, initial values are part of the problem; for a numerical step, also check step size and stability. A formally correct iteration does not guarantee an accurate approximation. The symbols must also match their definitions exactly: yn: Approximation at time tn (unit of y); h: Time step (unit of t); f(tn,yn): Slope from the differential equation (y per t). Do not calculate mechanically; write the assumption beside the setup, then check dimensions and sign. Also note: Under smoothness conditions, the method has global error order O(h) and is simple, but may be unstable for large steps The example For y′=y, y(0)=1, h=0.1: y1=1+0.1·1=1.1. The exact value is e0·1≈1.10517; error ≈0.00517. Check: the error typically decreases linearly when h is reduced. lets you follow these checks directly. If the assumptions do not fit, choose another relation from the chapter instead of forcing values into an unsuitable formula.
Quanta exam set
Curated exam set for "Forward Euler Method":
Question (front)
Which formula describes Forward Euler Method?
Answer in your set
Question (front)
How do you rearrange Forward Euler Method for Recover slope from two approximations?
Answer in your set
Question (front)
Which common mistake happens with Forward Euler Method?
Answer in your set
+ 7 more cards: units, variables, derivation, example, exam task
The formula set contains 10 cards. After importing, review them and start practicing; your ratings determine later review intervals.
This list names subject references and further reading. A page or section number appears when it is part of the reference; these are not verbatim quotations.
Create a curated FSRS exam set for yₙ₊₁=yₙ+h·f(tₙ,yₙ): formula recall, variables, derivation, rearrangement, worked example, common mistakes and exam context.
Curated formula set · LaTeX · FSRS spaced repetition · import from Essential