Unstructured 3-D Grid Partitioning Methods Based On Genetic Algorithms

Giannakoglou, K; Giotis, A

dc.contributor.author	Giannakoglou, K	en
dc.contributor.author	Giotis, A	en
dc.date.accessioned	2014-03-01T01:47:03Z
dc.date.available	2014-03-01T01:47:03Z
dc.date.issued	1998	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25127
dc.relation.uri	http://147.102.55.162/research/pdfs/3_040.pdf	en
dc.relation.uri	http://velos0.ltt.mech.ntua.gr/research/pdfs/3_040.pdf	en
dc.subject	Genetic Algorithm	en
dc.subject	Unstructured Grid	en
dc.title	Unstructured 3-D Grid Partitioning Methods Based On Genetic Algorithms	en
heal.type	journalArticle	en
heal.publicationDate	1998	en
heal.abstract	In this paper, two methods that are capable to efficiently partition 3-D unstructured grids for paral- lel processing, will be presented. Implicit to either of these methods are a recursive bisection pattern, a multi- level acceleration scheme and local refinement heuristics. Although both are based on Genetic Algorithms (GAs), their concept and formulation are completely different. The first method uses	en
heal.journalName	Advances in Engineering Software	en