Introductory university-level calculus, linear algebra, abstract algebra, probability, statistics, and stochastic processes.
Newton's method
Get link
Facebook
X
Pinterest
Email
Other Apps
-
Newton's method (the Newton-Raphson method) is a very powerful numerical method for solving nonlinear equations.
Suppose we'd like to solve a non-linear equation \(f(x) = 0\), where \(f(x)\) is a (twice) differentiable non-linear function. Newton's method generates a sequence of numbers \(c_1, c_2, c_3, \cdots\) that converges to a solution of the equation. That is, if \(\alpha\) is a solution (i.e., \(f(\alpha) = 0\)) then,
\[\lim_{n\to\infty}c_n = \alpha,\]
and this sequence \(\{c_n\}\) is generated by a series of linear approximations of the function \(f(x)\).
Theorem (Newton's method)
Let \(f(x)\) be a function that is twice differentiable on an open interval \(I\) that contains the closed interval \([a, b]\) (i.e., \([a,b]\subset I\)) and satisfy the following conditions:
\(f(a) < 0\) and \(f(b) > 0\);
For all \(x\in [a, b]\), \(f'(x) > 0\) and \(f''(x) > 0\).
where \(\alpha\) is the unique solution of \(f(\alpha) = 0\).
Proof. Since \(f(x)\) is (twice) differentiable, it is continuous on \([a,b]\). Since \(f(a) < 0\) and \(f(b) > 0\), clearly \(f(a) \neq f(b)\). Therefore, by the Intermediate Value Theorem, there exists an \(\alpha \in [a,b]\) such that \(f(\alpha) = 0\). Moreover, since \(f'(x) > 0\), \(f(x)\) is strictly monotone increasing on \([a,b]\), this \(\alpha\) is unique (i.e., there is only one such \(\alpha\) that satisfies \(f(\alpha) = 0\)).
Let us pick any \(c\in [a, b]\) and find the tangent line at \(x = c\), which is given by
\[y = f'(c)(x - c) + f(c).\]
The \(x\)-intercept \(x=c'\) of this line is obtained by
\[0 = f'(c)(c' - c) + f(c),\]
and hence
\[c' = c - \frac{f(c)}{f'(c)}.\]
Therefore if \(c = c_n\), we have \(c' = c_{n+1}\).
Moreover, since \(y=f(x)\) is convex (because \(f''(x) > 0\)), the tangent line is always resides below \(y=f(x)\) on \([a,b]\) so we have \(c' > \alpha\). Since \(f'(x) > 0\) and \(f(x) > 0\) (when \(x > \alpha\)), we have
\[c_{n+1} = c_n -\frac{f(c_n)}{f'(c_n)} < c_n.\]
Thus, \(\{c_n\}\) is a strictly monotone decreasing sequence bounded below. By the Monotone Convergence Theorem, \(\{c_n\}\) converges to a certain value. [See also: Monotone sequences and Cauchy sequences for the Monotone Convergence Theorem.]
Let \(\beta = \lim_{n\to\infty}c_n\), then \(\alpha \leq \beta < b\). If we take the limit \(n \to \infty\) on both sides of Eq. (eq:newton), we have
\[\beta = \beta - \frac{f(\beta)}{f'(\beta)},\]
from which we conclude
\[f(\beta) = 0.\]
However, \(\alpha\) is the only solution to \(f(x) = 0\). Hence \(\beta = \alpha\). ■
Example. Let \(d\) be any positive real number. Using Newton's method, let us find an approximation of \(\sqrt{d}\). First, let us define \(f(x) = x^2 - d\). Then the solution to \(f(x) = 0\) is \(x=\sqrt{d}\) (provided \(x \geq 0\)). \(f(0) = -d < 0\), and \(f'(x) = 2x > 0\) for \(x > 0\), and \(f''(0) = 2 > 0\). By choosing sufficiently small \(a\) and sufficiently large \(b\), \(f(x)\) can satisfy the conditions required for Newton's method. If we define the sequence \(\{c_n\}\) by
Open sets In \(\mathbb{R}\), we have the notion of an open interval such as \((a, b) = \{x \in \mathbb{R} | a < x < b\}\). We want to extend this idea to apply to \(\mathbb{R}^n\). We also introduce the notions of bounded sets and closed sets in \(\mathbb{R}^n\). Recall that the \(\varepsilon\)-neighbor of a point \(x\in\mathbb{R}^n\) is defined as \(N_{\varepsilon}(x) = \{y \in \mathbb{R}^n | d(x, y) < \varepsilon \}\) where \(d(x,y)\) is the distance between \(x\) and \(y\). Definition (Open set) A subset \(U\) of \(\mathbb{R}^n\) is said to be an open set if the following holds: \[\forall x \in U ~ \exists \delta > 0 ~ (N_{\delta}(x) \subset U).\tag{Eq:OpenSet}\] That is, for every point in an open set \(U\), we can always find an open ball centered at that point, that is included in \(U\). See the following figure. Perhaps, it is instructive to see what is not an open set. Negating (Eq:OpenSet), we have \[\exists x \in U ~ \forall \delta > 0 ~ (N_{\delta}(x) \not
We would like to study multivariate functions (i.e., functions of many variables), continuous multivariate functions in particular. To define continuity, we need a measure of "closeness" between points. One measure of closeness is the Euclidean distance. The set \(\mathbb{R}^n\) (with \(n \in \mathbb{N}\)) with the Euclidean distance function is called a Euclidean space. This is the space where our functions of interest live. The real line is a geometric representation of \(\mathbb{R}\), the set of all real numbers. That is, each \(a \in \mathbb{R}\) is represented as the point \(a\) on the real line. The coordinate plane , or the \(x\)-\(y\) plane , is a geometric representation of \(\mathbb{R}^2\), the set of all pairs of real numbers. Each pair of real numbers \((a, b)\) is visualized as the point \((a, b)\) in the plane. Remark . Recall that \(\mathbb{R}^2 = \mathbb{R}\times\mathbb{R} = \{(x, y) | x, y \in \mathbb{R}\}\) is the Cartesian product of \(\mathbb{R}\) with i
We can use multiple integrals to compute areas and volumes of various shapes. Area of a planar region Definition (Area) Let \(D\) be a bounded closed region in \(\mathbb{R}^2\). \(D\) is said to have an area if the multiple integral of the constant function 1 over \(D\), \(\iint_Ddxdy\), exists. Its value is denoted by \(\mu(D)\): \[\mu(D) = \iint_Ddxdy.\] Example . Let us calculate the area of the disk \(D = \{(x,y)\mid x^2 + y^2 \leq a^2\}\). Using the polar coordinates, \(x = r\cos\theta, y = r\sin\theta\), \(dxdy = rdrd\theta\), and the ranges of \(r\) and \(\theta\) are \([0, a]\) and \([0, 2\pi]\), respectively. Thus, \[\begin{eqnarray*} \mu(D) &=& \iint_Ddxdy\\ &=&\int_0^a\left(\int_0^{2\pi}rd\theta\right)dr\\ &=&2\pi\int_0^a rdr\\ &=&2\pi\left[\frac{r^2}{2}\right]_0^a = \pi a^2. \end{eqnarray*}\] □ Volume of a solid figure Definition (Volume) Let \(V\) be a solid figure in the \((x,y,z)\) space \(\mathbb{R}^3\). \(V\) is sai
Comments
Post a Comment