Talk:Euler method

Convergence?

It would be nice to see a section on the convergence of the method as $h\to 0$.

Error in the first illustration

I believe there is an error in the illustration (http://en.wikipedia.org/wiki/File:Euler_method.png) because in this image the solution points are not equally spaced while, apparently, the segments have the same length. I think this is wrong, because the (plain) Euler method computes points at t+n*h, so they are evenly spaced. — Preceding unsigned comment added by 78.12.252.87 (talk) 22:31, 5 June 2013 (UTC)

Informal Geometric Description

Whoever wrote this section is a saint. Every math-related wikipedia article needs a section like this to spur understanding in readers. Thank you. — Preceding unsigned comment added by 76.29.46.158 (talk) 03:10, 27 September 2013 (UTC)

SN-order?

was is das? Some1Redirects4You (talk) 17:10, 27 April 2015 (UTC)

it doesn't seem to mean anything. it should be replace by "first order"

"not often used"

In the numerical stability section, it reads: This limitation —along with its slow convergence of error with h— means that the Euler method is not often used, except as a simple example of numerical integration. This is wrong. The Euler method is probably the most used method. Most computer games use forward Euler to simulate kinematics and mechanics. Backward Euler is also widely used for its robustness, simplicity and high speed. Higher-order methods work fine for simple problems, but complex simulations often rely on first-order methods. Italo Tasso (talk) 23:04, 7 June 2017 (UTC)

Popular Culture: "Hidden Figures"

It would improve the quality of the article if it made the statement if Euler's Method actually played the role described in the movie, or if that was pure "poetic license", or possibly something in between.66.25.171.16 (talk) 02:35, 25 June 2017 (UTC)

To do so, we would need a reliable source directly discussing Euler's Method in the movie vs. history. - SummerPhD^v2.0 16:00, 25 June 2017 (UTC)

*sigh*

Anyone see what's wrong with the highlighted line below? Anyone? Care to guess? Here's a hint: it's the math version of "burying the lede" in journalism.

Example

Given the initial value problem

$y'=y,\quad y(0)=1,$

we would like to use the Euler method to approximate $y(4)$.

Using step size equal to 1 (h = 1)

The Euler method is

$y_{n+1}=y_{n}+hf(t_{n},y_{n}).\qquad \qquad$

Joeedh (talk) 06:07, 3 April 2019 (UTC)

AWFUL SOURCE CODE HACKS DO NOT BELONG IN AN ENCYCLOPEDIA of Math

The source code is INCORRECT HACK CODE because it does not use arbitrary precision math and contains no method to compensate for it's lack of doing so AND NO WARNING OF LIMITATIONS (there may be, likely are, other source code problems). This is, of course, A CRITICAL MISTAKE for an algorithm which is "supposed to become more accurate, not less" as terms progress. It is a hack.

Algorithms belong in anthologies (such as "The Art of Computer Programming", Donald E. Knuth).

Also: modern mathematics, ex Mathematica, have approximation methods built-in to handle the above mentioned and many other important factors of modern mathematics.

The worst burden acceptable would be a URL to "computer algo section containing code" or an external link. — Preceding unsigned comment added by 2601:143:400:547B:2529:40EF:1365:4F7 (talk) 16:24, 6 November 2019 (UTC)