Inexact simplified Newton iterations for implicit Runge-Kutta methods

SIAM Journal on Numerical Analysis

Volumn 38, Issue 4, 2001, Pages 1369-1388

  Jay, Laurent O ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

Contraction; GMRES; Implicit Runge Kutta methods; Inexact simplified Newton methods; Linear iterative methods; Nonlinear equations; Ordinary differential equations; Preconditioning; Richardson iterations; Stiffness; W transformation

Indexed keywords

EID: 0034431557     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036142999360573     Document Type: Article

References (34)

1. E. ANDERSON, Z. BAI, G. BISCHOF, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, S. OSTROUCHOV, AND D. SORENSEN, LAPACK User's Guide, 2nd ed., SIAM, Philadelphia, 1995.
2. R. E. BANK AND D. J. ROSE, Global approximate Newton methods, Numer. Math., 37 (1981), pp. 279-295.
3. P. N. BROWN AND A. C. HINDMARSH, Matrix-free methods for stiff systems of ODE's, SIAM J. Numer. Anal., 23 (1986), pp. 610-638.
4. P. N. BROWN, A. C. HINDMARSH, AND L. R. PETZOLD, Using Krylov methods in the solution of large-scale differential-algebraic systems, SIAM J. Sci. Comput., 15 (1994), pp. 1467-1488.
5. P. N. BROWN AND Y. SAAD, Hybrid Krylov methods for nonlinear systems of equations, SIAM J. Sci. Stat. Comput., 11 (1990), pp. 450-481.
6. S. L. CAMPBELL, I. C. F. IPSEN, C. T. KELLEY, AND C. D. MEYER, GMRES and the minimal polynomial, BIT, 36 (1996), pp. 32-43.
7. R. P. K. CHAN, On symmetric Runge-Kutta methods of high order, Computing, 45 (1990), pp. 301-309.
8. T. F. CHAN AND K. R. JACKSON, The use of iterative linear-equation solvers in codes for large systems of stiff IVPs for ODEs, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 378-417.
9. G. J. COOPER AND J. C. BUTCHER, An iteration scheme for implicit Runge-Kutta methods, IMA J. Numer. Anal., 3 (1983), pp. 127-140.
10. G. J. COOPER AND R. VIGNESVARAN, A scheme for the implementation of implicit Runge-Kutta methods, Computing, 45 (1990), pp. 321-332.
11. R. S. DEMBO, S. C. EISENSTAT, AND T. STEIHAUG, Inexact Newton methods, SIAM J. Numer. Anal., 19 (1982), pp. 400-408.
12. S. C. EISENSTAT AND H. F. WALKER, Globally convergent inexact Newton method, SIAM J. Optim., 4 (1994), pp. 393-422.
13. S. C. EISENSTAT AND H. F. WALKER, Choosing the forcing terms in an inexact Newton method, SIAM J. Sci. Comput., 17 (1996), pp. 16-32.
14. V. FRAYSSÉ, L. GIRAUD, AND S. GRATTON, A Set of GMRES Routines for Real and Complex Arithmetic, Tech. Rep. PA/97/49, CERFACS, Toulouse, France, 1997.
15. G. W. GEAR AND Y. SAAD, Iterative solution of linear equations in ODE codes, SIAM J. Sci. Statist. Comput., 4 (1983), pp. 583-601.
16. A. GEORGE, On block elimination for sparse linear systems, SIAM J. Numer. Anal., 11 (1974), pp. 585-603.
17. G. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, 1996.
18. S. GONZÁLEZ-PINTO, C. GONZÁLEZ-CONCEPCIÓN, AND J. I. MONTIJANO, Iterative schemes for Gauss methods, Comput. Math. Appl., 27 (1994), pp. 67-81.
19. S. GONZÁLEZ-PINTO, J. I. MONTIJANO, AND L. RÁNDEZ, Iterative schemes for three-stage implicit Runge-Kutta methods, Appl. Numer. Math., 17 (1995), pp. 363-382.
20. A. GREENBAUM, Iterative Methods for Solving Linear Systems, Frontiers Appl. Math. 17, SIAM, Philadelphia, 1997.
21. E. HAIRER, S. P. NØRSETT, AND G. WANNER, Solving Ordinary Differential Equations I. Non-stiff problems, 2nd ed., Springer Ser. Comput. Math. 18, Springer-Verlag, Berlin, 1993.
22. E. HAIRER AND G. WANNER, Algebraically stable and implementable Runge-Kutta methods of high order, SIAM J. Numer. Anal., 18 (1981), pp. 1098-1108.
23. E. HAIRER AND G. WANNER, Characterization of non-linearly stable implicit Runge-Kutta methods, in Numerical Integration of Differential Equations, Lecture Notes in Math. 968, Springer, Berlin, New York, 1982, pp. 207-219.
24. E. HAIRER AND G. WANNER, Solving Ordinary Differential Equations II. Stiff and Differential-Algebraic Problems, 2nd ed., Springer Ser. Comput. Math. 14, Springer-Verlag, Berlin, 1996.
25. W. HOFFMANN AND J. J. B. DE SWART, Approximating Runge-Kutta matrices by triangular matrices, BIT, 37 (1997), pp. 346-354.
26. L. JAY, Symplectic partitioned Runge-Kutta methods for constrained Hamiltonian systems, SIAM J. Numer. Anal., 33 (1996), pp. 368-387.
27. L. O. JAY, Structure preservation for constrained dynamics with super partitioned additive Runge-Kutta methods, SIAM J. Sci. Comput., 20 (1998), pp. 416-446.
28. L. O. JAY, User's Guide to SPARK3, Tech. Rep., Department of Math., University of Iowa, 2000, in preparation.
29. L. O. JAY AND T. BRACONNIER, A parallelizable preconditioner for the iterative solution of implicit Runge-Kutta type methods, J. Comput. Appl. Math., 111 (1999), pp. 63-76.
30. C. T. KELLEY, Iterative Methods for Linear and Nonlinear Equations, Frontiers Appl. Math. 16, SIAM, Philadelphia, 1995.
31. W. RHEINBOLDT, Methods for Solving Systems of Nonlinear Equations, 2nd ed., CBMS-NSF Regional Conf. Ser. in Appl. Math. 70, SIAM, Philadelphia, 1998.
32. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS Publishing Co., Boston, 1996.
33. Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
34. P. J. VAN DER HOUWEN AND J. J. B. DE SWART, Triangularly implicit iteration methods for ODE-IVP solvers, SIAM J. Sci. Comput., 18 (1997), pp. 41-55.