Parallel frequency filtering

W. Weiler, Gabriel Wittum*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

The frequency filtering method is a robust and efficient ILU-like solver for large sparse systems (cf. [9,10]). Combining this method with the so-called Schur-complement DD method, we obtain a fast parallel solver. In this context, frequency filtering can be applied as solver inside the subdomains as well as for the treatment of the arising Schur complements. Especially for those, the method is well suited since it is highly parallelizable by recursively applying the same decomposition as to the original system. In this paper, an implementation of the frequency filtering domain decomposition (FFDD) method on a multiprocessor system will be presented and the numerical results of some variants thereof be discussed. The scaling behaviour of the algorithm for an increasing number of processors is almost optimal.

Original languageEnglish (US)
Pages (from-to)303-316
Number of pages14
JournalComputing (Vienna/New York)
Volume58
Issue number4
DOIs
StatePublished - Jan 1 1997

Keywords

  • Frequency filtering
  • Schur-complement

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Numerical Analysis
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Parallel frequency filtering'. Together they form a unique fingerprint.

Cite this