Supriya Ghosh (Editor)

Kantorovich theorem

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

The Kantorovich theorem is a mathematical statement on the convergence of Newton's method. It was first stated by Leonid Kantorovich in 1940.

Contents

Newton's method constructs a sequence of points that under certain conditions will converge to a solution x of an equation f ( x ) = 0 or a vector solution of a system of equation F ( x ) = 0 . The Kantorovich theorem gives conditions on the initial point of this sequence. If those conditions are satisfied then a solution exists close to the initial point and the sequence converges to that point.

Assumptions

Let X ⊂ R n be an open subset and F : R n ⊃ X → R n a differentiable function with a Jacobian F ′ ( x ) that is locally Lipschitz continuous (for instance if F is twice differentiable). That is, it is assumed that for any open subset U ⊂ X there exists a constant L > 0 such that for any x , y ∈ U

∥ F ′ ( x ) − F ′ ( y ) ∥ ≤ L ∥ x − y ∥

holds. The norm on the left is some operator norm that is compatible with the vector norm on the right. This inequality can be rewritten to only use the vector norm. Then for any vector v ∈ R n the inequality

∥ F ′ ( x ) ( v ) − F ′ ( y ) ( v ) ∥ ≤ L ∥ x − y ∥ ∥ v ∥

must hold.

Now choose any initial point x 0 ∈ X . Assume that F ′ ( x 0 ) is invertible and construct the Newton step h 0 = − F ′ ( x 0 ) − 1 F ( x 0 ) .

The next assumption is that not only the next point x 1 = x 0 + h 0 but the entire ball B ( x 1 , ∥ h 0 ∥ ) is contained inside the set X. Let M ≤ L be the Lipschitz constant for the Jacobian over this ball.

As a last preparation, construct recursively, as long as it is possible, the sequences ( x k ) k , ( h k ) k , ( α k ) k according to

h k = − F ′ ( x k ) − 1 F ( x k ) α k = M ∥ F ′ ( x k ) − 1 ∥ ∥ h k ∥ x k + 1 = x k + h k .

Statement

Now if α 0 ≤ 1 2 then

  1. a solution x ∗ of F ( x ∗ ) = 0 exists inside the closed ball B ¯ ( x 1 , ∥ h 0 ∥ ) and
  2. the Newton iteration starting in x 0 converges to x ∗ with at least linear order of convergence.

A statement that is more precise but slightly more difficult to prove uses the roots t ∗ ≤ t ∗ ∗ of the quadratic polynomial

p ( t ) = ( 1 2 L ∥ F ′ ( x 0 ) − 1 ∥ − 1 ) t 2 − t + ∥ h 0 ∥ , t ∗ / ∗ ∗ = 2 ∥ h 0 ∥ 1 ± 1 − 2 α

and their ratio

θ = t ∗ t ∗ ∗ = 1 − 1 − 2 α 1 + 1 − 2 α .

Then

  1. a solution x ∗ exists inside the closed ball B ¯ ( x 1 , θ ∥ h 0 ∥ ) ⊂ B ¯ ( x 0 , t ∗ )
  2. it is unique inside the bigger ball B ( x 0 , t ∗ ∗ )
  3. and the convergence to the solution of F is dominated by the convergence of the Newton iteration of the quadratic polynomial p ( t ) towards its smallest root t ∗ , if t 0 = 0 , t k + 1 = t k − p ( t k ) p ′ ( t k ) , then ∥ x k + p − x k ∥ ≤ t k + p − t k .
  4. The quadratic convergence is obtained from the error estimate

Literature

  • Kantorowitsch, L. (1948): Functional analysis and applied mathematics (russ.). UMN3, 6 (28), 89–185.
  • Kantorowitsch, L. W.; Akilow, G. P. (1964): Functional analysis in normed spaces.
  • P. Deuflhard: Newton Methods for Nonlinear Problems. Affine Invariance and Adaptive Algorithms., Springer, Berlin 2004, ISBN 3-540-21099-7 (Springer Series in Computational Mathematics, Vol. 35)

    • References

    Kantorovich theorem Wikipedia
    (Text) CC BY-SA