Question 6 of 7: Root-Finding by Bisection, Newton's Method, and Fixed-Point Iteration
Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
Notes on this paper
National Examinations, May 2018 — 04-BS-5 Advanced Mathematics, 3 hours, closed book (approved Casio/Sharp calculator and one double-sided aid sheet permitted). Any five of the seven questions constitute a complete paper and all questions are of equal value; all seven are answered below as a full study resource.
Reference texts: Kreyszig, Advanced Engineering Mathematics, 10th ed. (Wiley) — Ch. 5 (Series Solutions of ODEs about an ordinary point), Ch. 11 (Fourier Series, Fourier Integrals and Transforms), Ch. 19 (Numerics in General: interpolation, numerical differentiation, Romberg integration, iterative equation solving), Ch. 20 (Numeric Linear Algebra: Cholesky/LU factorization). Supporting: Chapra & Canale, Numerical Methods for Engineers, 7th ed. — Ch. 5–6 (bracketing and open root-finding methods), Ch. 18 (interpolation), Ch. 22 (Romberg integration); Strang, Introduction to Linear Algebra, 6th ed. — Ch. 2 (Cholesky/LU factorization).
Question 6: Root-Finding by Bisection, Newton's Method, and Fixed-Point Iteration (A(a): 6; A(b): 6; B: 8 marks)
Given. (A) $h(x)=2e^{-x}-3\cos x$, root bracketed in $[-1,0]$. (B) $p(x)=x^4-3x^3+5$, root near $x_0=2$.
Find. (A)(a) The bracket after 3 bisections (6-digit arithmetic). (b) Two further Newton iterations from that point (7-digit arithmetic). (B) Five fixed-point iterations of a valid rearrangement $x=g(x)$ (7-digit arithmetic).
Approach. (A) Confirm the sign change, bisect three times tracking the sub-interval that keeps the sign change, then switch to Newton's method for quadratic convergence. (B) Rearrange $p(x)=0$ into a form $x=g(x)$ with $|g'(\text{root})|\lt1$ near $x_0=2$, then iterate.
(A)(a) Confirm the bracket and bisect three times. $h(-1)=2e^{1}-3\cos(1)=5.436564-1.620907=3.815657\gt0$; $h(0)=2-3=-1\lt0$, confirming a sign change on $[-1,0]$.
(A)(b) Switch to Newton's method. With $h'(x)=-2e^{-x}+3\sin x$, starting from $x_0=-0.3125$ and using $x_{k+1}=x_k-h(x_k)/h'(x_k)$ (7-digit arithmetic):
$$x_1=-0.312500-\dfrac{h(-0.312500)}{h'(-0.312500)}=\boxed{-0.345604}$$
$$x_2=-0.345604-\dfrac{h(-0.345604)}{h'(-0.345604)}=\boxed{-0.344804}$$
The true root (by high-precision root-finding) is $-0.344804$ to six decimals — the second Newton iterate already matches to 6 significant figures, illustrating Newton's quadratic convergence once bisection has supplied a good starting bracket.
(B) Rearrange into a convergent fixed-point form. Writing $x^4-3x^3+5=0$ as $x^3(x-3)=-5$, i.e. $x-3=-5/x^3$, gives
$$\boxed{g(x)=3-\dfrac{5}{x^3}}$$
Its derivative $g'(x)=15/x^4$ is small near the root ($g'\approx0.257$ at the root $\approx2.76$, found below), so $|g'(\text{root})|\lt1$ and the iteration converges there (a rearrangement like $x=(3x^3-5)^{1/4}$ would instead diverge from $x_0=2$, since its derivative exceeds 1 in magnitude near the root).
Iterate five times from $x_0=2$ (7-digit arithmetic).
Fixed-point iterates $x_{k+1}=g(x_k)$
$k$
0
1
2
3
4
5
$x_k$
2.0000000
2.3750000
2.6267678
2.7241297
2.7526644
2.7602767
$$\boxed{x_5=2.7602767\ \text{after 5 iterations}}$$
(the true root, found by bisection/Newton to high precision, is $2.7629419$; the iteration is converging steadily towards it, with the error shrinking by roughly the factor $g'(\text{root})\approx0.257$ each step, consistent with linear convergence.)