The realization of the finite element method on parallel computers
is usually based on a domain decomposition approach. This paper is
concerned with the problem of finding an optimal decomposition and an
appropriate mapping of the subdomains to the processors. The quality
of this partitioning is measured in several metrics but it is also
expressed in the computing time for solving specific systems of
finite element equations.
The software environment is first described. In particular, the data
structure and the accumulation algorithm are introduced. Then
several partitioning algorithms are compared. Spectral bisection was
used with different modifications including Kernighan-Lin refinement,
post-processing techniques and terminal propagation. The final
recommendations should give good decompositions for all finite
element codes which are based on principles similar to ours.
The paper is a shortened English version of Preprint SFB393/96-18
(Uwe Reichel: Partitionierung von Finite-Elemente-Netzen), SFB 393,
TU Chemnitz-Zwickau, December 1996. To be selfcontained, some material
of Preprint SPC95_5 (see below) is included. The paper appeared as
Preprint SFB393/96-18a, SFB 393, TU Chemnitz-Zwickau, January 1997.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:bsz:ch1-199801107 |
| Date | 30 October 1998 |
| Creators | Reichel, U. |
| Contributors | TU Chemnitz, SFB 393 |
| Publisher | Universitätsbibliothek Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:preprint |
| Format | application/pdf, application/postscript, text/plain, application/zip |
Page generated in 0.0025 seconds