Accessibility navigation


Computational complexity of weighted splitting schemes on parallel computers

Csomos, P., Dimov, I., Farago, I., Havasi, A. and Ostromsky, T.Z. (2007) Computational complexity of weighted splitting schemes on parallel computers. International Journal of Parallel, Emergent and Distributed Systems , 22 (3). pp. 137-147. ISSN 1744-5760

Full text not archived in this repository.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1080/17445760601111517

Abstract/Summary

In models of complicated physical-chemical processes operator splitting is very often applied in order to achieve sufficient accuracy as well as efficiency of the numerical solution. The recently rediscovered weighted splitting schemes have the great advantage of being parallelizable on operator level, which allows us to reduce the computational time if parallel computers are used. In this paper, the computational times needed for the weighted splitting methods are studied in comparison with the sequential (S) splitting and the Marchuk-Strang (MSt) splitting and are illustrated by numerical experiments performed by use of simplified versions of the Danish Eulerian model (DEM).

Item Type:Article
Refereed:Yes
Divisions:Faculty of Science
ID Code:15194
Uncontrolled Keywords:Air pollution modeling, Computational complexity, Distributed memory, Operator splitting, Shared memory

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation