Theorem by Kantorovich

from Wikipedia, the free encyclopedia

The Kantorovich theorem is a statement of applied mathematics and guarantees the convergence of Newton's method with minimal conditions. It was first published in 1940 by Leonid Vitalievich Kantorowitsch .

requirements

Let it be an open convex subset and a differentiable function whose derivative is locally Lipschitz continuous .

That is, for each of the exist Jacobi matrix F '( x ) of the partial derivatives, and there is for each limited subset of a constant L> 0 with

for any .

The norm of the difference of the Jacobi matrices is the induced matrix norm . This resolved into the vector norm results in the condition

for arbitrary points and tangent vectors .

A point in X is known so that the Jacobi matrix can be inverted. Let be the Newton step and the next member of the Newton iteration.

Let it denote the length of the Newton step.

statement

If the sphere around the point with the length of the first Newton step as a radius is still completely in U and the inequality is

fulfilled, where M is the Lipschitz constant on B , then

  1. there is a unique solution of the vector equation within the closed sphere and
  2. the Newton iteration with the starting point converges to this solution with at least a linear convergence speed.

generalization

The normalized space can be replaced by any Banach space in the domain of definition and value; the differentiability is then defined by the Frechet derivation.

Even in the finite-dimensional case, the norms can be selected differently in the domain of definition and the domain of values . With the special choice

results z. B. that

applies. The simpler form of the convergence condition has to be weighed against the more complex form of the estimation of the Lipschitz constant.

Evidence sketch

One can show that for a convex region U with Lipschitz's constant M the first derivative always has the inequality

applies if x and x + h are contained in U. For and with the Newton step it follows in particular

.

Because of

is also invertible according to the theorem for the Neumann series and it holds

These two estimates can be combined to form an estimate of the next Newton step :

and the parameter controlling the convergence

.

The ball to radius is completely in B and in X contain the Lipschitz constant of the smaller ball can only be smaller than M . So all the prerequisites for the next step are in place. This is continued through induction for the entire Newton iteration. The result is a sequence of spheres contained within one another, the radius of which is at least halved in each step. The common average of all spheres is therefore exactly one point, which is also the limit value of the Newton iteration. The function values ​​of the Newton iteration are reduced in each step to a quarter of the previous function value, i.e. they form a zero sequence. The limit of the Newton iteration solves the vector equation F (x) = 0 .

swell

literature

  • Kantorowitsch, L. (1948): Functional Analysis and Applied Mathematics (Russian). UMN3, 6 (28), 89-185.
  • Kantorowitsch, LW; Akilow, GP (1964): Functional Analysis in Normalized Spaces . Berlin .
  • P. Deuflhard: Newton Methods for Nonlinear Problems. Affine Invariance and Adaptive Algorithms. , Springer, Berlin 2004, ISBN 3-540-21099-7 (Series: Springer Series in Computational Mathematics , Vol. 35)