Numerics Learn interactively.
Numerical methods made tangible — accuracy, convergence and their pitfalls.
All subjects App catalogue
All apps. Free in your browser.
Euler's method
Explicit Euler step by step: read off the slope at the starting point, follow the tangent for one step size h, new point. The dashed solution curve through each point shows how the method jumps onto neighbouring curves and errors add up. Enter your own right-hand side f(x, y) or pick a preset (slide example, oscillation, growth, decay, logistic); slide the step size, compare with h/2 and h/4, read the error in a log-log plot — order 1, special cases and instability for too large h.
NumericsTry itMultigrid method
Solve the Laplace equation (Dirichlet) via multigrid: the error at each grid level as a stacked 3D wireframe relief. Smoothers (Jacobi/Gauss-Seidel) remove high frequencies, restriction/prolongation/coarse-grid solve the smooth remainder — V/W cycle step by step, with error history and a solution heatmap.
NumericsTry itNewton's method
Root finding via tangent linearization: xₖ₊₁ = xₖ − f(xₖ)/f′(xₖ). Step by step to quadratic convergence — including a divergence example that shows when the method fails.
NumericsTry itNumerical integration
Approximate the area under f(x) with rectangles, trapezoids or Simpson parabolas. Slide n and see in the log–log diagram how the order of convergence (slope) determines the method: O(h) vs. O(h²) vs. O(h⁴).
NumericsTry it