Parallelization of Implicit-Explicit Runge-Kutta methods for cluster of PCs

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Several physical phenomena of great importance in science and engineering are described by large partly stiff differential systems where the stiff terms can be easily separated from the remaining terms. Implicit-Explicit Runge-Kutta (IMEXRK) methods have proven to be useful solving these systems efficiently. However, the application of these methods still requires a large computational effort and their parallel implementation constitutes a suitable way to achieve acceptable response times. In this paper, a technique to parallelize and implement efficiently IMEXRK methods on PC clusters is proposed. This technique has been used to parallelize a particular IMEXRK method and an efficient parallel implementation of the resultant scheme has been derived in a structured manner by following a component-based approach. Several numerical experiments which have been performed on a cluster of dual PCs reveal the good speedup and the satisfactory scalability of the parallel solver obtained. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Mantas, J. M., González, P., & Carrillo, J. A. (2005). Parallelization of Implicit-Explicit Runge-Kutta methods for cluster of PCs. In Lecture Notes in Computer Science (Vol. 3648, pp. 815–825). Springer Verlag. https://doi.org/10.1007/11549468_89

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free