# GATE1997-4.3

281 views

Using the forward Euler method to solve $y’'(t) = f(t), y’(0)=0$ with a step size of $h$, we obtain the following values of $y$ in the first four iterations:

1. $0, hf (0), h(f(0) + f(h)) \text{ and }h(f(0) - f(h) + f(2h))$

2. $0, 0, h^2f(0)\text{ and } 2h^2 f(0) + f(h)$

3. $0, 0, h^2f(0) \text{ and } 3h^2f(0)$

4. $0, 0, hf(0) + h^2f(0) \text{ and }hf (0) + h^2f(0) + hf(h)$

reopened

## Related questions

1
516 views
The trapezoidal method to numerically obtain $\int_a^b f(x) dx$ has an error E bounded by $\frac{b-a}{12} h^2 \max f&rsquo;&rsquo;(x), x \in [a, b]$ where $h$ is the width of the trapezoids. The minimum number of trapezoids guaranteed to ensure $E \leq 10^{-4}$ in computing $\ln 7$ using $f=\frac{1}{x}$ is 60 100 600 10000
1 vote
The Newton-Raphson method is used to find the root of the equation $X^2-2=0$. If the iterations are started from -1, the iterations will converge to -1 converge to $\sqrt{2}$ converge to $\sqrt{-2}$ not converge
Use Simpson's rule with $h=0.25$ to evaluate $V= \int_{0}^{1} \frac{1}{1+x} dx$ correct to three decimal places.