Accelerated inexact Newton schemes for large systems of nonlinear equations

SIAM Journal on Scientific Computing

Volumn 19, Issue 2, 1998, Pages 657-674

  Fokkema, Diederik R ^a   Sleijpeni, Gerard L G ^b   Van Der Vorst, Henk A ^b  

^a SYNOPSYS SWITZERLAND LLC   (Switzerland)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Inexact Newton; Iterative methods; Newton's method; Nonlinear problems

Indexed keywords

EID: 0000281811     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827595296148     Document Type: Article

References (31)

1. W. E. ARNOLDI, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 17-29.
2. O. AXELSSON, AND A. T. CHRONOPOULOS, On nonlinear generalized conjugate gradient methods, Numer. Math., 69 (1994), pp. 1-16.
3. J. G. L. BOOTEN H. A. VAN DER VORST, P. M. MEIJER, AND H. J. J. TE RIELE, A Preconditioning Jacobi-Davidson Method for Solving Large Generalized Eigenvalue Problems, Report NM-R9414, Dept. Num. Math., CWI, Amsterdam, 1994.
4. P. N. BROWN AND Y. SAAD, Hybrid Krylov methods for nonlinear systems of equations, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 450-481.
5. M. CROUZEIX, B. PHILIPPE, AND M. SADKANE, The Davidson method, SIAM J. Sci. Comput., 15 (1994), pp. 62-76.
6. E. R. DAVIDSON, The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real symmetric matrices, J. Comput. Phys., 17 (1975), pp. 87-94.
7. E. DE STURLER AND D. R. FOKKEMA, Nested Krylov methods and preserving the orthogonality, in Sixth Copper Mountain Conference on Multigrid Methods, N. D. Melson, T. A. Manteuffel, and S. F. McCormick, eds., NASA Conference Publication 3324, Part 1, NASA Langley Research Center, Hampton, VA, 1993, pp. 111-126.
8. R. S. DEMBO, S. C. EISENSTAT, AND T. STEIHAUG, Inexact Newton methods, SIAM J. Numer. Anal., 19 (1982), pp. 400-408.
9. J. E. DENNIS, JR. AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983.
10. D. R. FOKKEMA, G. L. G. SLEIJPEN, AND H. A. VAN DER VORST, Generalized conjugate gradient squared, J. Comput. Appl. Math., 71 (1996), pp. 125-146.
11. R. W. FREUND AND N. M. NACHTIGAL, QMR: A quasi minimal residual method for non-Hermitian linear systems, Numer. Math., 60 (1991), pp. 315-339.
12. R. GLOWINSKI, H. B. KELLER, AND L. REINHART, Continuation-conjugate gradient methods for the least squares solution of nonlinear boundary value problems, SIAM J. Sci. Statist. Comput., 6 (1985), pp. 793-832.
13. I. GUSTAFSSON, A class of first order factorizations methods, BIT, 18 (1978), pp. 142-156.
14. xx, Comm. Pure Appl. Math., 3 (1950), pp. 201-230.
15. I. E. KAPORIN AND O. AXELSSON, On a class of nonlinear equation solvers based on the residual norm reduction over a sequence of affine subspaces, SIAM J. Sci. Comput., 16 (1995), pp. 228-249.
16. T. KERKHOVEN AND Y. SAAD, Acceleration Techniques for Decoupling Algorithms in Semiconductor Simulation, Report UIUCDCS-R-87-1363, Dept. of Comp. Sci., University of Illinois, Urbana, IL, 1987.
17. C. LANCZOS, Solution of systems of linear equations by minimized iteration, J. Res. Nat. Bur. Standards, 49 (1952), pp. 33-53.
18. J. A. MEIJERINK AND H. A. VAN DER VORST, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp., 31 (1977), pp. 148-162.
19. C. B. MOLER AND G. W. STEWART, An algorithm for generalized matrix eigenvalue problems, SIAM J. Numer. Anal., 10 (1973), pp. 241-256.
20. J. J. MORÉ, The Levenberg-Marquardt algorithm: Implementation and theory, in Numerical Analysis, G. A. Watson, ed., Lecture Notes in Mathematics 630, Springer-Verlag, Berlin, Heidelberg, New York, 1977, pp. 105-116.
21. R. B. MORGAN, Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices, J. Comput. Phys., 101 (1992), pp. 287-291.
22. C. C. PAIGE, B. N. PARLETT, AND H. A. VAN DER VORST, Approximate solutions and eigenvalue bounds from Krylov subspaces, Linear Algebra Appl., 2 (1995), pp. 115-133.
23. Y. SAAD, Krylov subspace method for solving large unsymmetric linear systems, Math. Comp., 37 (1981), pp. 105-126.
24. Y. SAAD, Numerical Methods for Large Eigenvalue Problems, Manchester University Press, Manchester, UK, 1992.
25. Y. SAAD, A flexible inner-outer preconditioned GMRES algorithm, SIAM J. Sci. Comput., 14 (1993), pp. 461-469.
26. Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimum residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
27. G. L. G. SLEIJPEN, J. G. L. BOOTEN, D. R. FOKKEMA, AND H. A. VAN DER VORST, Jacobi-Davidson Type Methods for Generalized Eigenproblems and Polynomial Eigenproblems, BIT, 36 (1996), pp. 595-633.
28. G. L. G. SLEIJPEN AND H. A. VAN DER VORST, A Jacobi-Davidson iteration method for linear eigenvalue problems, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 401-425.
29. H. A. VAN DER VORST AND C. VUIK, GMRESR: A family of nested GMRES methods, Linear Algebra Appl., 1 (1994), pp. 369-386.
30. C. VUIK, Further Experiences with GMRESR, Tech. report 92-12, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, the Netherlands, 1992.
31. D. M. YOUNG AND K. C. JEA, Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods, Linear Algebra Appl., 34 (1980), pp. 159-194.