Euler's Method Calculator
March a first-order ODE with Euler's method, printing the first ten steps and the final value with the step count.
Euler's Method Calculator
March a first-order ODE with Euler's method, printing the first ten steps and the final value with the step count.
How this page computes
The page evaluates dy/dx = f(x, y) at each step and adds h times the slope. It prints the first ten rows and the final value, and names the first-order method and the step count.
The calculation runs entirely in this browser tab; nothing is uploaded.
The page solves dy/dx = f(x, y) numerically with Euler's method and prints the first ten steps and the final value. Worked example: y' = x + y from y(0) = 1 with h = 0.1 reaches about 3.1875 at x = 1.
The step size and step count are inputs, and the output names both. Euler's method is first-order, so the page labels the approximation rather than implying an exact solution.
How to use Euler's Method Calculator
Enter the slope as an expression in x and y, set x0, y0, h and the number of steps, then press Run. The table shows the first ten rows and the final line gives the endpoint value.
The recurrence is y_(n+1) = y_n + h*f(x_n, y_n). A smaller h usually improves the answer, and the page lets you compare runs at the same step count.
The Euler recurrence
Euler's method follows the tangent line at each point: the slope is evaluated at the current (x, y), multiplied by h and added to y, then x advances by h.
The local error is O(h^2) and the global error is O(h), which is why the method is called first-order. The page states the step count so the approximation is used with that order in mind.
What to Expect
Best for
- Seeing a numerical ODE solution step by step
- Comparing step sizes
- Checking a hand-computed Euler table
Not ideal for
- A high-accuracy solution, where RK4 is better
- A stiff equation
- A symbolic closed-form solution
What this tool keeps
- The slope expression, initial values, step size and step count
What may need cleanup
- The final value is an approximation; the method order and step count state its quality
Common errors
- A non-finite slope is refused at its x and y
- A zero step size is refused
Example use cases
- Solve y' = x + y from (0, 1)
- Compare h = 0.1 and h = 0.05
Sample input
x + y
Sample output
Euler's method for dy/dx = x + y, y(0) = 1, h = 0.1, 10 steps n = 0: x = 0, y = 1 n = 1: x = 0.1, y = 1.1 n = 2: x = 0.2, y = 1.22 n = 3: x = 0.3, y = 1.362 n = 4: x = 0.4, y = 1.5282 n = 5: x = 0.5, y = 1.72102 n = 6: x = 0.6, y = 1.943122 n = 7: x = 0.7, y = 2.1974342 n = 8: x = 0.8, y = 2.48717762 n = 9: x = 0.9, y = 2.815895382 final: y(1) ≈ 3.1874849202 first-order method; the stated step count is the whole approximation
Who this is for
- Students learning numerical ODEs
- Readers checking an Euler table
Frequently asked questions
Why only the first ten steps?
Ten rows show the recurrence clearly without turning the output into a long table. The final value is always printed, so a run of a thousand steps still reports its endpoint.
How accurate is Euler's method?
Its global error is first-order in h, so halving the step roughly halves the error. That is much less accurate than RK4 at the same step count, and the page names the order rather than promising a tolerance.
Can the slope depend on y?
Yes, and that is the normal case. The expression is evaluated with both x and y at the current point, so y' = x + y, y' = -2*y and similar first-order equations are all supported.
Is anything uploaded?
Nothing is uploaded. The recurrence runs in this browser tab with JavaScript, and reloading the page discards the expression, the table and the final value.
Build custom tools for your store
Join the SDK program to create useful ecommerce utilities for your store.