自适应方案的并行完全重网格

Juan J. Pombo, J. C. Cabaleiro, T. F. Pena
{"title":"自适应方案的并行完全重网格","authors":"Juan J. Pombo, J. C. Cabaleiro, T. F. Pena","doi":"10.1109/ICPPW.2001.951853","DOIUrl":null,"url":null,"abstract":"In order to improve the convergence ratio and to automate Finite Element Methods, several strategies have been introduced. One of these is the adaptive scheme. This approximation presents limitations for parallelism since the generation of a conformal, valid and well conditioned finite element mesh is a time consuming task, and now it appears as a main task in each iteration of the adaptation procedure. This work is motivated by the use of the h-adaptive method in its most flexible form, where a complete reconstruction of the whole mesh have to be performed whenever a solution over the current mesh has been obtained and until error criteria are achieved. We focused on the problem of the fast generation of tetrahedral unstructured meshes in a parallel fashion over geometric models with some given refinement criteria. The chosen strategy implies the use of an octal tree, octree, as a key hierarchical data structure to guide the algorithm. The codes have been developed using the MPI library in a SGI Origin 200 multiprocessor.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"123 1","pages":"73-78"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Parallel complete remeshing for adaptive schemes\",\"authors\":\"Juan J. Pombo, J. C. Cabaleiro, T. F. Pena\",\"doi\":\"10.1109/ICPPW.2001.951853\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to improve the convergence ratio and to automate Finite Element Methods, several strategies have been introduced. One of these is the adaptive scheme. This approximation presents limitations for parallelism since the generation of a conformal, valid and well conditioned finite element mesh is a time consuming task, and now it appears as a main task in each iteration of the adaptation procedure. This work is motivated by the use of the h-adaptive method in its most flexible form, where a complete reconstruction of the whole mesh have to be performed whenever a solution over the current mesh has been obtained and until error criteria are achieved. We focused on the problem of the fast generation of tetrahedral unstructured meshes in a parallel fashion over geometric models with some given refinement criteria. The chosen strategy implies the use of an octal tree, octree, as a key hierarchical data structure to guide the algorithm. The codes have been developed using the MPI library in a SGI Origin 200 multiprocessor.\",\"PeriodicalId\":93355,\"journal\":{\"name\":\"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops\",\"volume\":\"123 1\",\"pages\":\"73-78\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPPW.2001.951853\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPPW.2001.951853","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

为了提高收敛率和实现有限元方法的自动化,介绍了几种策略。其中之一是适应性方案。由于生成保形、有效和条件良好的有限元网格是一项耗时的任务,因此这种近似存在并行性的局限性,现在它成为自适应过程每次迭代的主要任务。这项工作的动机是使用最灵活的h-自适应方法,每当获得当前网格的解决方案时,必须执行整个网格的完整重建,直到达到误差标准。我们重点研究了在给定精化标准的几何模型上以并行方式快速生成四面体非结构化网格的问题。所选择的策略意味着使用八进制树(octree)作为关键的分层数据结构来指导算法。这些代码是在SGI Origin 200多处理器上使用MPI库开发的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Parallel complete remeshing for adaptive schemes
In order to improve the convergence ratio and to automate Finite Element Methods, several strategies have been introduced. One of these is the adaptive scheme. This approximation presents limitations for parallelism since the generation of a conformal, valid and well conditioned finite element mesh is a time consuming task, and now it appears as a main task in each iteration of the adaptation procedure. This work is motivated by the use of the h-adaptive method in its most flexible form, where a complete reconstruction of the whole mesh have to be performed whenever a solution over the current mesh has been obtained and until error criteria are achieved. We focused on the problem of the fast generation of tetrahedral unstructured meshes in a parallel fashion over geometric models with some given refinement criteria. The chosen strategy implies the use of an octal tree, octree, as a key hierarchical data structure to guide the algorithm. The codes have been developed using the MPI library in a SGI Origin 200 multiprocessor.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信