Efficient Parallel Solution of Parabolic Equations: Implicit Methods on the Cedar Multicluster

A class of implicit methods for the parallel solution of linear parabolic differential equations based on Pade and Chebyshev rational approximations to the matrix exponential are presented. It is pointed out that this approach incorporates both natural hierarchical parallelism, improved intrinsic efficiency, and fewer timesteps. These advantages lead to an extremely fast family of methods for the solution of certain time-dependent problems. These techniques are illustrated with numerical experiments on the University of Illinois Cedar multicluster architecture. The experiments indicate that implicit methods of very high degree offer great promise for the solution of certain parabolic problems when in computational environment with parallel resources. Hierarchically organized parallel computers, such as the Cedar multicluster, are found to be especially attractive for these schemes.

[1]  W. E. Culham,et al.  A comparison of Crank-Nicolson and Chebyshev rational methods for numerically solving linear parabolic equations , 1972 .

[2]  David A. Swayne,et al.  High-Order Near Best Uniform Approximations to the Solution of Heat Conduction Problems , 1980, IFIP Congress.

[3]  R. Varga On Higher Order Stable Implicit Methods for Solving Parabolic Partial Differential Equations , 1961 .

[4]  Owe Axelsson,et al.  High-order methods for parabolic problems , 1975 .

[5]  R. Varga,et al.  Chebyshev rational approximations to e−x in [0, +∞) and applications to heat-conduction problems , 1969 .

[6]  On implicit Runge-Kutta methods for parallel computations , 1987 .

[7]  Yousef Saad,et al.  A Parallel Block Cyclic Reduction Algorithm for the Fast Solution of Elliptic Equations , 1987, ICS.

[8]  V. Zakian Numerical inversion of Laplace transform , 1969 .

[9]  Yousef Saad,et al.  On the parallel solution of parabolic equations , 1989, ICS '89.

[10]  R. Freund On conjugate gradient type methods and polynomial preconditioners for a class of complex non-hermitian matrices , 1990 .

[11]  Ohannes A. Karakashian,et al.  On Runge-Kutta methods for parabolic problems with time-dependent coefficients , 1986 .

[12]  S. Serbin On factoring a class of complex symmetric matrices without pivoting , 1980 .

[13]  Ben P. Sommeijer,et al.  Embedded diagonally implicit Runge-Kutta algorithms on parallel computers , 1989 .

[14]  O. Karakashian,et al.  On the parallel implementation of implicit Runge-Kutta methods , 1988 .

[15]  Efstratios Gallopoulos,et al.  Experiments with Elliptic Problem Solvers on the Cedar Multicluster , 1989, PPSC.

[16]  N. Pomphrey,et al.  DIAGONAL PAD ] APPROXIMATIONS FOR INITIAL VALUE PROBLEMS * , 1988 .

[17]  R. Varga,et al.  Extended numerical computations on the “1/9” conjecture in rational approximation theory , 1984 .