We propose new parallel algorithms for the solution of linear parabolic problems. The first of these methods is based on using polynomial approximation to the exponential. It does not require solving any linear systems and is highly parallelizable. The two other methods proposed are based on Padé and Chebyshev approximations to the matrix exponential. The paralielization of these methods is achieved by using partial fraction decomposition techniques to solve the resulting systems and thus offers the potential for increased time parallelism in time dependent problems. We also present experimental results from the Alliant FX/8 and the Cray Y-MP/832 vector multiprocessors.
|Original language||English (US)|
|Title of host publication||Proceedings of the 3rd International Conference on Supercomputing, ICS 1989|
|Publisher||Association for Computing Machinery|
|Number of pages||12|
|State||Published - Jun 1 1989|
|Event||3rd International Conference on Supercomputing, ICS 1989 - Crete, Greece|
Duration: Jun 5 1989 → Jun 9 1989
|Name||Proceedings of the International Conference on Supercomputing|
|Other||3rd International Conference on Supercomputing, ICS 1989|
|Period||6/5/89 → 6/9/89|
Bibliographical noteFunding Information:
The research of the first author was supported by the National Science Foundation under Grants No. US NSF-MIP-8410110, US NSF DCR85-09970, US NSF CCR-8717942 and by AT&T Grant AT&T AFFL67Sameh. The research of the second author was supported by NASA under USRA Grant No. NCC 2-387.
© 1989 ACM.