Computational complexity of weighted splitting schemes on parallel computers

P. Csomós, I. Dimov, I. Faragó, Á Havasi, T. Z. Ostromsky

Research output: Contribution to journalArticle

2 Citations (Scopus)


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).

Original languageEnglish
Pages (from-to)137-147
Number of pages11
JournalInternational Journal of Parallel, Emergent and Distributed Systems
Issue number3
Publication statusPublished - Jan 2007


  • Air pollution modeling
  • Computational complexity
  • Distributed memory
  • Operator splitting
  • Shared memory

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Computational complexity of weighted splitting schemes on parallel computers'. Together they form a unique fingerprint.

  • Cite this