Abstract
The high q-convergence orders of the inexact Newton iterates were characterized by Ypma in terms of some affine invariant conditions. Using these results, we obtain affine invariant characterizations for the q-convergence orders of the inexact perturbed Newton iterates.
Authors
Emil Cătinaş
(Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy)
Keywords
inexact perturbed Newton methods; affine invariant conditions; q-convergence orders.
Cite this paper as:
E. Cătinaş, Affine invariant conditions for the inexact perturbed Newton method, Rev. Anal. Numér. Théor. Approx., 31 (2002) no. 1, pp. 17-20, https://ictp.acad.ro/jnaat/journal/article/view/2002-vol31-no1-art3
Scanned paper.
Latex-pdf version of the paper.
https://ictp.acad.ro/jnaat/journal/article/view/2002-vol31-no1-art3/Catinas
About this paper
Publisher Name
Paper on the journal website
Print ISSN
1222-9024
Online ISSN
2457-8126
MR
1222-9024
Online ISSN
2457-8126
Google Scholar citations
[1] I. Argyros and F. Szidarovsky, The Theory and Applications of Iteration Methods, C.R.C. Press Inc., Boca Raton, FL, 1993.
[2] E. Catinas, On the high convergence orders of the Newton-GMBACK methods, Rev.Anal. Numer. Th ́eor. Approx.,28(1999) no. 2, 125-132, https://ictp.acad.ro/jnaat
[3] E. Catinas, Newton and Newton-Krylov Methods for Solving Nonlinear Systems inRn, Ph.D. thesis, “Babes–Bolyai” University of Cluj-Napoca, Romania, 1999.
[4] E. Catinas, A note on the quadratic convergence of the inexact Newton methods, Rev.Anal. Numer. Theor. Approx.,29(2000) no. 2, 129-133, https://ictp.acad.ro/jnaat
[5] E. Catinas, Inexact perturbed Newton methods and applications to a class of Krylovsolvers, J. Optim. Theory Appl.,108(2001) no. 3, 543-570, https://ictp.acad.ro/catinas/catinaspb.htm
[6] E. Catinas, On the superlinear convergence of the successive approximations method, J. Optim. Theory Appl.,113(2002) no. 3, 473-485, https://ictp.acad.ro/catinas/catinaspb.htm
[7] E. Catinas, The inexact, inexact perturbed and quasi-Newton methods are equivalentmodels, Math. Comp.74(2005) no. 249, 291-301, https://ictp.acad.ro/catinas/catinaspb.htm
[8] Dembo, R. S., Eisenstat, S. C. and Steihaug, T., Inexact Newton methods, SIAMJ. Numer. Anal.,19(1982), pp. 400-408.
[9] Deuflhard, P.and Heindl, G., Affine invariant convergence theorems for Newton’smethod and extensions to related methods, SIAM J. Numer. Anal.,16(1979), pp. 1-10.
[10] Deuflhard, P.and Potra, F. A., Asymptotic mesh independence of Newton-Galerkin methods via a refined Mysovskii theorem, SIAM J. Numer. Anal.,29(1992), pp. 1395-1412.
[11] Ortega, J. M.and Rheinboldt, W. C., Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
[12] Walker, H. F., An approach to continuation using Krylov subspace methods, Computational Science in the 21st Century, M.-O. Bristeau, G. Etgen, W. Fitzgibbon, J. L.Lions, J. Periaux and M. F. Wheeler, eds., John Wiley and Sons, Ltd., 1997, pp. 72-82.
[13] Ypma, T. J., Local convergence of inexact Newton methods, SIAM J. Numer. Anal.,21(1984), pp. 583-590.Received by the editors: October 3, 2001.
Paper (preprint) in HTML form
Abstract
The high convergence orders of the inexact Newton iterates were characterized by Ypma in terms of some affine invariant conditions. Using these results, we obtain affine invariant characterizations for the convergence orders of the inexact perturbed Newton iterates.
Rev. Anal. Numér. Théor. Approx., vol. 31 (2002) no. 1, pp. 17-20
AFFINE INVARIANT CONDITIONS
FOR THE INEXACT PERTURBED NEWTON METHOD*
MSC 2000. 65 H 10 .
Keywords. inexact and inexact perturbed Newton methods, affine invariant conditions, convergence orders.
1. INTRODUCTION
Given a nonlinear mapping , the inexact Newton (IN) method for solving the system is given by the iterations:
where represent the residuals of the approximate solutions of the linear systems. The local convergence of these iterates to a solution is usually studied under the following assumptions, which we shall implicitly assume throughout this paper:
-
•
the mapping is Fréchet differentiable on a neighborhood of , with continuous at ;
-
•
the Jacobian is invertible.
We recall that, given an arbitrary norm on , a sequence is said that converges ( -)superlinearly to its limit if
also denoted by , as . For rigorous definitions and results concerning the high convergence orders we refer the reader to [11, ch. 9].
The high convergence orders of the IN iterates were characterized by Dembo, Eisenstat and Steihaug.
† "T. Popoviciu" Institute of Numerical Analysis, P.O. Box 68-1, 3400 Cluj-Napoca, Romania (ecatinas@ictp.acad.ro).
Theorem 1. 8. Assume that the IN iterates converge to . Then the convergence is superlinear if and only if
If, additionally, is Hölder continuous with exponent at , i.e., there exist such that
then the convergence is with order if and only if
In the inexact perturbed Newton (IPN) method there is assumed that at each step there appear different errors: the Jacobians are perturbed, the functions evaluations are approximately performed, and the resulting linear systems are only approximately solved:
We have obtained the following characterizations for the convergence of these iterates.
Theorem 2. 5. Assume that the IPN iterates are uniquely defined (i.e. the perturbations are such that the matrices are invertible for ) and converge to . Then the convergence is superlinear if and only if
If, additionally, is Hölder continuous with exponent at , then the convergence is with order if and only if
Theorem 3. [7]. Assume that the IPN iterates are well defined (i.e. the perturbed linear systems are compatible) and converge to . Then the convergence is superlinear if and only if
If, additionally, is Hölder continuous with exponent at , then the convergence is with order if and only if
2. MAIN RESULTS
The affine invariant conditions are those conditions which do not change when considering, instead of the original system, the modified system 0 , where is nonsingular. The (exact) Newton iterates remain the same under such transformation, such that the conditions on the convergence of the iterates should also remain unchanged.
Ypma has obtained in [13] the following characterizations for the IN iterates, which are affine invariant.
Theorem 4. 13. Assume that the IN iterates converge to . Then the convergence is superlinear if and only if
If, additionally, is Hölder continuous with exponent at , then the convergence is with order if and only if
Using this result, we obtain the following affine invariant results for the inexact perturbed Newton method:
Theorem 5. Assume that the IPN iterates are uniquely defined and converge to . Then the convergence is superlinear if and only if
If, additionally, is Hölder continuous with exponent at , then the convergence is with order if and only if
Theorem 6. Assume that the IPN iterates are well defined and converge to . Then the convergence is superlinear if and only if
If, additionally, is Hölder continuous with exponent at , then the convergence is with order if and only if
The proofs are easily obtained by using the fact that the IPN iterates are IN iterates having the residuals
REFERENCES
[1] I. Argyros and F. Szidarovsky, The Theory and Applications of Iteration Methods, C.R.C. Press Inc., Boca Raton, FL, 1993.
[2] E. Cătinaş, On the high convergence orders of the Newton-GMBACK methods, Rev. Anal. Numér. Théor. Approx., 28 (1999) no. 2, 125-132.
[3] E. Cătinaş, Newton and Newton-Krylov Methods for Solving Nonlinear Systems in , Ph.D. thesis, "Babes-Bolyai" University of Cluj-Napoca, Romania, 1999.
[4] E. Cătinaş, A note on the quadratic convergence of the inexact Newton methods, Rev. Anal. Numér. Théor. Approx., 29 (2000) no. 2, 129-133.
[5] E. Catinaş, Inexact perturbed Newton methods and applications to a class of Krylov solvers, J. Optim. Theory Appl., 108 (2001) no. 3, 543-570.
[6] E. Cătinaş, On the superlinear convergence of the successive approximations method, J. Optim. Theory Appl., 113 (2002) no. 3, 473-485.
[7] E. Cătinaş, The inexact, inexact perturbed and quasi-Newton methods are equivalent models, Math. Comp. 74 (2005) no. 249, 291-301.
[8] Dembo, R. S., Eisenstat, S. C., and Steihaug, T., Inexact Newton methods, SIAM J. Numer. Anal., 19 (1982), pp. 400-408.
[9] Deuflhard, P. and Heindl, G., Affine invariant convergence theorems for Newton’s method and extensions to related methods, SIAM J. Numer. Anal., 16 (1979), pp. 1-10.
[10] Deuflhard, P. and Potra, F. A., Asymptotic mesh independence of Newton-Galerkin methods via a refined Mysovskii theorem, SIAM J. Numer. Anal., 29 (1992), pp. 13951412.
[11] Ortega, J. M. and Rheinboldt, W. C., Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
[12] Walker, H. F., An approach to continuation using Krylov subspace methods, Computational Science in the 21st Century, M.-O. Bristeau, G. Etgen, W. Fitzgibbon, J. L. Lions, J. Periaux and M. F. Wheeler, eds., John Wiley and Sons, Ltd., 1997, pp. 72-82.
[13] Ypma, T. J., Local convergence of inexact Newton methods, SIAM J. Numer. Anal., 21 (1984), pp. 583-590.
Received by the editors: October 3, 2001.
