Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Discrete mathematics, continuous mathematics and probability / 6 / c / i

Table of contents
- Solution i

Solution

The Forward Euler method uses the current slope:

x_{n + 1} = x_{n} + h, y_{n + 1} = y_{n} + h f (x_{n}, y_{n}) .

Here

x_{n} = x_{0} + nh

and the initial approximation normally equals the given initial value. Each step takes a tangent-line increment of width

h

.

 Ancestors (12)

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version