This shows you the differences between two versions of the page.
Next revision | Previous revision | ||
euler [2019/11/18 13:34] 127.0.0.1 external edit |
— (current) | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== Euler ====== | ||
- | |||
- | Euler’s Method | ||
- | |||
- | Explicit fixed-step solver of first order. The Euler method named after Leonard Euler is the most basic kind of explicit method for the numerical integration of ordinary differential equatioDELETEMEns. | ||
- | |||
- | If the initial value problem we want to approximate is defined by | ||
- | |||
- | **y’(t) = f(t,y(t)), y(t_0) = y_0,** | ||
- | |||
- | we use the first two terms of the Taylor expansion of **y**, which represents the linear approximation around the point (t_0, y(t_0)). One step of the Euler method from '' | ||
- | |||
- | **y_n+1 = y_n + h// | ||
- | |||
- | The Euler method can be numerically unstable, especially for stiff equations. This limitation—along with its slow convergence of error with '' | ||
- | |||
- | The [[Butcher_tableau|Butcher tableau]] of the Euler forward method is: | ||
- | |||
- | ||1| | | ||
- | || |0| | ||
- | |||
- | Applicable [[Solver_settings|solver settings]]: | ||
- | |||
- | * Fixed-step size | ||
- | * Limit data points to last | ||
- | |||
- | ===== Reference ===== | ||
- | |||
- | * http:// | ||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||