Iterated Radau Method for Time-Dependent PDE's

摘要

This paper is concerned with the time integration of semi-discretized, multi-dimensional PDE's of advection-diffusion-reaction type. To cope with the stiffness of these ODE's, an implicit method has been selected, for example, the two-stage, third-order Radau IIA method. The main topic of this paper is the efficient solution of the resulting implicit relations. First a modified Newton process has been transformed into an iteration process in which the 2 stages are decoupled and, moreover, can exploit the same LU-factorization of the iteration matrix. Next, we apply a socalled Approximate Matrix Factorization (AMF) technique to solve the linear systems in each Newton iteration. This AMF approach is very efficient since it reduces the 'multi-dimensional' system to a series of 'one-dimensional' systems. The total amount of linear algebra work involved is reduced enormously by this approach. The idea of applying AMF to two-dimensional problems is quite old and goes back to Peaceman and Rachford in the early fifties. The situation in three space dimensions is less favourable and will be analyzed here in more detail, both theoretically and experimentally. Furthermore, we analyze a variant in which the AMF-technique has been used to really solve ('until convergence') the underlying Radau IIA method so that we can rely on its excellent stability and accuracy characteristics. Finally, the method has been tested on several examples. Also a comparison has been made with the existing codes VODPK and IMEXRKC, and the efficiency (CPU time versus accuracy) is shown to be at least competitive with the efficiency of these solvers.