Free to use, no account

Differential Equation Solver

Approximate a first-order initial-value problem y′ = f(x,y) with fixed-step Runge–Kutta 4. Enter the derivative, starting point and value, endpoint, and step count. Everything runs in this browser.

Use x and y, numbers, + − × ÷ and ^. Supported functions: sin, cos, tan, exp, ln, log, sqrt and abs. Write multiplication explicitly, such as x*y.

Fixed-step classical RK4 for a first-order initial-value ODE only. Supports up to 10,000 steps; x must stay within ±1,000,000 and y within ±1,000,000,000,000. The graph and CSV show up to about 101 sampled points. Numerical results can be inaccurate near discontinuities, singularities or for stiff equations. It does not find symbolic general solutions or certify error.

How does the RK4 differential equation solver work?

RK4 estimates the solution using four slope evaluations per step. Smaller steps often improve accuracy for smooth solutions, but this numerical estimate is not a symbolic or exact solution.

Frequently asked questions

How does the RK4 differential equation solver work?

RK4 estimates the solution using four slope evaluations per step. Smaller steps often improve accuracy for smooth solutions, but this numerical estimate is not a symbolic or exact solution.

Are my equation and values uploaded?

No. The calculation, graph and CSV are created in this browser. This tool does not upload or save your inputs.

What does the Runge–Kutta method calculate?

It estimates the path of a solution from a starting point by repeatedly using several derivative samples in each step. This page uses the classical fourth-order RK method.

How many steps should I use?

Start with the example and compare results using more steps. A smaller step may improve a smooth solution, but it cannot fix a singularity or make a stiff equation suitable for this basic method.

Can it solve every differential equation exactly?

No. It numerically approximates supported first-order initial-value problems. It does not provide a symbolic general solution, prove uniqueness or guarantee an error bound.