基于freefem++的大规模并行体系结构的高性能域分解方法

J. Num. Math. Pub Date : 2012-12-31 DOI:10.1515/jnum-2012-0015

P. Jolivet, V. Dolean, F. Hecht, F. Nataf, C. Prud'homme, N. Spillane

{"title":"基于freefem++的大规模并行体系结构的高性能域分解方法","authors":"P. Jolivet, V. Dolean, F. Hecht, F. Nataf, C. Prud'homme, N. Spillane","doi":"10.1515/jnum-2012-0015","DOIUrl":null,"url":null,"abstract":"Abstract - In this document, we present a parallel implementation in freefem++ of scalable two-level domain decomposition methods. Numerical studies with highly heterogeneous problems are then performed on large clusters in order to assert the performance of our code.","PeriodicalId":342521,"journal":{"name":"J. Num. Math.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"High performance domain decomposition methods on massively parallel architectures with freefem++\",\"authors\":\"P. Jolivet, V. Dolean, F. Hecht, F. Nataf, C. Prud'homme, N. Spillane\",\"doi\":\"10.1515/jnum-2012-0015\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract - In this document, we present a parallel implementation in freefem++ of scalable two-level domain decomposition methods. Numerical studies with highly heterogeneous problems are then performed on large clusters in order to assert the performance of our code.\",\"PeriodicalId\":342521,\"journal\":{\"name\":\"J. Num. Math.\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Num. Math.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/jnum-2012-0015\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Num. Math.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/jnum-2012-0015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 38

摘要

在本文中，我们给出了一个在freef++中并行实现的可伸缩的两级域分解方法。然后在大型集群上执行高度异构问题的数值研究，以断言我们的代码的性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

High performance domain decomposition methods on massively parallel architectures with freefem++

Abstract - In this document, we present a parallel implementation in freefem++ of scalable two-level domain decomposition methods. Numerical studies with highly heterogeneous problems are then performed on large clusters in order to assert the performance of our code.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

J. Num. Math.

自引率

0.00%

发文量