수치적분

(a) When $0 \leq x \leq1$, then $x^2 \leq 1$ and $x+1 \geq 1$, so $|f''(x)| = \dfrac{x^2}{|x+1|}\leq \dfrac{1}{1}=1$. (b) To find the maximum value of a function over a closed interval, we test the function's values at the endpoints of the interval and at its critical points inside the interval. The critical points are where the function's derivative is zero or does not exist.

The function we're trying to maximize is $|f''(x)| = \frac{x^2}{|x+1|} = \frac{x^2}{x+1}=f''(x)$ (since our interval only contains nonnegative numbers). So, the critical points occur when $f'''(x) = 0$ or does not exist. We find $f'''(x)$ Using the quotient rule.

$$\begin{aligned} f'''(x)&=\frac{(x+1)(2x)-x^2}{(x+1)^2}=\frac{x^2+2x}{(x+1)^2}\\ 0&=\frac{x(x+2)}{x+1}\\ 0&=x \quad\text{or}\quad x=-1\quad\text{or}\quad x=-2 \end{aligned}$$

The only critical point in $[0,1]$ is $x=0$. So, the extrema of $f''(x)$ over $[0,1]$ will occur at its endpoints. Indeed, since $f'''(x) \geq 0$ for all $x$ in $[0,1]$, $f''(x)$ is increasing over this interval, so its maximum occurs at $x=1$. That is, $$|f''(x)|\leq f''(1)=\frac{1}{2}$$ (c) The absolute error using the midpoint rule is at most $\dfrac{M(b-a)^3}{24n^2}$. Using $M=1$, if we want this to be no more than $10^{-5}$, we find an acceptable value of $n$ with the following calculation:

$$\begin{aligned} \dfrac{M(b-a)^3}{24n^2}&\leq 10^{-5}\\ \dfrac{1}{24n^2}&\leq 10^{-5}&(b-a=1,\,M=1)\\ \frac{10^5}{24} & \leq n^2\\ n & \geq 65 \end{aligned}$$ (d) The absolute error using the midpoint rule is at most $\dfrac{M(b-a)^3}{24n^2}$. Using $M=\frac{1}{2}$, if we want this to be no more than $10^{-5}$, we find an acceptable value of $n$ with the following calculation:

$$\begin{aligned} \dfrac{M(b-a)^3}{24n^2}&\leq 10^{-5}\\ \dfrac{1}{48n^2}&\leq 10^{-5}&(b-a=1,\,M=\frac{1}{2})\\ \frac{10^5}{48} & \leq n^2\\ n & \geq 46 \end{aligned}$$

Remark: how accurate you want to be in these calculations depends a lot on your circumstances. Imagine, for instance, that you were finding $M$ by hand, using this to find $n$ by hand, then programming a computer to evaluate the approximation. For a simple integral like this, the difference between computing time for 65 intervals versus 46 is likely to be miniscule. So, there's not much to be gained by the extra work in (b). However, if your original sloppy $M$ gave you something like $n=1000000$, you might want to put some time into improving it, to shorten computation time. Moreover, if you were finding the approximation by hand, the difference between adding 46 terms and adding 65 terms would be considerable, and you would probably want to put in the effort up front to find the most accurate $M$ possible.