Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
There are two kinds of Euler approximations called explicit and implicit. The explicit is a bit faster but the implicit one is much more stable.
What you do is approximating the solution to an initial-value problem by piece-wise affine functions. So explicit Euler is the easiest approximation method you can think of. Just calculate the elevation at the starting point, go a bit in that direction and take the resulting end point as the new starting point. Then repeat that step.
so instead of going to x=0 you just step down a bit?
You have given a initial value problem \[f'(t) = F(t, f(t)),\; f(t_0) = y_0\] So the starting point is (t_0, y_0). Also you must choose a step size h, which then gives you the precision. The elevation at the starting point is \[f'(t_0) = F(t_0, y_0)\] So going in that direction you get the approximation \[f(t_0 + h) \approx y_0 + h\cdot F(t_0, y_0)\]
ahhh... that sounds more like integration methods.... unless im mistaken :)
Well yes, solving initial-value problems / differential equations is a generalization of integration.
i was thinking more along the lines of the Newton stuff in the books finding roots and what nots. ok