A parallelizable preconditioner for the iterative solution of implicit Runge-Kutta-type methods

Journal of Computational and Applied Mathematics

Volumn 111, Issue 1-2, 1999, Pages 63-76

  Jay, Laurent O ^a   Braconnier, Thierry ^b  

^a UNIVERSITY OF MINNESOTA   (United States)

^b UNIVERSITÉ DE LA RÉUNION   (France)

Author keywords

Implicit Runge Kutta method; Inexact simplified Newton iteration; Iterative method; Parallelism; Preconditioning* Stiffness* W transformation

Indexed keywords

APPROXIMATION THEORY; ASYMPTOTIC STABILITY; ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS; NONLINEAR EQUATIONS; ORDINARY DIFFERENTIAL EQUATIONS; PROBLEM SOLVING;

IMPLICIT EULER METHOD; INEXACT SIMPLIFIED NEWTON ITERATIONS; PARALLELIZABLE PRECONDITIONERS; SUPER PARTITIONED ADDITIVE RUNGE-KUTTA (SPARK) METHODS;

RUNGE KUTTA METHODS;

EID: 0033355808     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(99)00132-6     Document Type: Article

References (27)

1. Alexander R. Diagonally implicit Runge-Kutta methods for stiff ODEs. SIAM J. Numer. Anal. 14:1977;1006-1021.
2. Bendtsen C. Highly stable parallel Runge-Kutta methods. Appl. Numer. Math. 21:1996;1-8.
3. Brown P.N., Hindmarsh A.C. Matrix-free methods for stiff systems of ODE's. SIAM J. Numer. Anal. 23:1986;610-638.
4. Brown P.N., Hindmarsh A.C., Petzold L.R. Using Krylov methods in the solution of large-scale differential-algebraic systems. SIAM J. Sci. Comput. 15:1994;1467-1488.
5. Burrage K. A special family of Runge-Kutta methods for solving stiff differential equations. BIT. 18:1978;22-41.
6. Chan R.P.K. On symmetric Runge-Kutta methods of high order. Computing. 45:1990;301-309.
7. Chan T.F., Jackson K.R. The use of iterative linear equation solvers in codes for large systems of stiff IVPs for ODEs. SIAM J. Sci. Statist. Comput. 7:1986;378-417.
8. Cooper G.J., Butcher J.C. An iteration scheme for implicit Runge-Kutta methods. IMA J. Numer. Anal. 3:1983;127-140.
9. Cooper G.J., Vignesvaran R. A scheme for the implementation of implicit Runge-Kutta methods. Computing. 45:1990;321-332.
10. M. Crouzeix, Sur l'approximation des équations différentielles opérationnelles linéaires par des méthodes de Runge-Kutta, Ph.D. Thesis, Univ. Paris VI, France, 1975.
11. Dembo R.S., Eisenstat S.C., Steihaug T. Inexact Newton methods. SIAM J. Numer. Anal. 19:1982;400-408.
12. Gear C.W., Saad Y. Iterative solution of linear equations in ODE codes. SIAM J. Sci. Statist. Comput. 4:1983;583-601.
13. Geng S. Construction of high order symplectic Runge-Kutta methods. J. Comput. Math. 11:1993;250-260.
14. George J.A. On block elimination for sparse linear systems. SIAM J. Numer. Anal. 11:1974;585-603.
15. G. Golub, C.F. van Loan, Matrix computations, Johns Hopkins Studies in the Math. Sci., 3rd Edition, The Johns Hopkins Univ. Press, Baltimore, 1996.
16. González-Pinto S., González-Concepción C., Montijano J.I. Iterative schemes for Gauss methods. Comput. Math. Appl. 27:1994;67-81.
17. González-Pinto S., Montijano J.I., Rández L. Iterative schemes for three-stage implicit Runge-Kutta methods. Appl. Numer. Math. 17:1995;363-382.
18. Hairer E., Wanner G. Algebraically stable and implementable Runge-Kutta methods of high order. SIAM J. Numer. Anal. 18:1981;1098-1108.
19. E. Hairer, G. Wanner, Characterization of non-linearly stable implicit Runge-Kutta methods, in Numerical Integration of Differential Equations, Lecture Notes in Mathematics, Vol. 968, 1982, pp. 207-219.
20. E. Hairer, G. Wanner, Solving Ordinary Differential Equations II. Stiff and Differential-Algebraic Problems, 2nd Revised Edition, Comput. Math., Vol. 14, Springer, Berlin, 1996.
21. Hoffmann W., de Swart J.J.B. Approximating Runge-Kutta matrices by triangular matrices. BIT. 37:1997;346-354.
22. Jay L.O. Structure-preservation for constrained dynamics with super partitioned additive Runge-Kutta methods. SIAM J. Sci. Comput. 20:1999;416-446.
23. S.P. N ø rsett, Semi-explicit Runge-Kutta methods, Technical Report 6/74 Dept. of Math., Univ. of Trondheim, Norway, 1974.
24. Orel B. Parallel Runge-Kutta methods with real eigenvalues. APNUM. 11:1993;241-250.
25. W. Rheinboldt, Methods for Solving Systems of Nonlinear Equations, SIAM Classics in Appl. Math. SIAM, Philadelphia, Second Revised and Expanded Edition, 1999.
26. Saad Y., Schultz M.H. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Statist Comput. 7:1986;856-869.
27. van der Houwen P.J., de Swart J.J.B. Triangularly implicit iteration methods for ODE-IVP solvers. SIAM J. Sci. Comput. 18:1997;41-55.