HEAL DSpace

Subdomain cluster generation for domain decomposition methods using graph partitioning optimization

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Charmpis, DC en
dc.contributor.author Papadrakakis, M en
dc.date.accessioned 2014-03-01T01:19:35Z
dc.date.available 2014-03-01T01:19:35Z
dc.date.issued 2003 en
dc.identifier.issn 0264-4401 en
dc.identifier.uri http://hdl.handle.net/123456789/15592
dc.subject Optimization en
dc.subject Parallel programming en
dc.subject.classification Computer Science, Interdisciplinary Applications en
dc.subject.classification Engineering, Multidisciplinary en
dc.subject.classification Mathematics, Interdisciplinary Applications en
dc.subject.classification Mechanics en
dc.subject.other Computational methods en
dc.subject.other Computer simulation en
dc.subject.other Finite element method en
dc.subject.other Heuristic methods en
dc.subject.other Linear equations en
dc.subject.other Mathematical transformations en
dc.subject.other Mechanics en
dc.subject.other Optimization en
dc.subject.other Parallel processing systems en
dc.subject.other Problem solving en
dc.subject.other Stiffness matrix en
dc.subject.other Computational efficiencies en
dc.subject.other Computational mechanics en
dc.subject.other Domain decomposition methods en
dc.subject.other Graph partitioning optimization en
dc.subject.other Subdomain cluster generation en
dc.subject.other Graph theory en
dc.title Subdomain cluster generation for domain decomposition methods using graph partitioning optimization en
heal.type journalArticle en
heal.identifier.primary 10.1108/02644400310502973 en
heal.identifier.secondary http://dx.doi.org/10.1108/02644400310502973 en
heal.language English en
heal.publicationDate 2003 en
heal.abstract Balancing and dual domain decomposition methods (DDMs) comprise a family of efficient high performance solution approaches for a large number of problems in computational mechanics. Such DDMs are used in practice on parallel computing environments with the number of generated subdomains being generally larger than the number of available processors. This paper presents an effective heuristic technique for organizing the subdomains into subdomain clusters, in order to assign each cluster to a processor. This task is handled by the proposed approach as a graph partitioning optimization problem using the publicly available software METIS. The objective of the optimization process is to minimize the communication requirements of the DDMs under the constraint of producing balanced processor workloads. This constraint optimization procedure for treating the subdomain cluster generation task leads to increased computational efficiencies for balancing and dual DDMs. en
heal.publisher EMERALD GROUP PUBLISHING LIMITED en
heal.journalName Engineering Computations (Swansea, Wales) en
dc.identifier.doi 10.1108/02644400310502973 en
dc.identifier.isi ISI:000223976000007 en
dc.identifier.volume 20 en
dc.identifier.issue 7-8 en
dc.identifier.spage 932 en
dc.identifier.epage 963 en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record