{"title":"自适应并行多网格","authors":"L. Stals","doi":"10.1109/ICAPP.1995.472269","DOIUrl":null,"url":null,"abstract":"Early experiments with parallel multigrid used square domains and uniform grids. More recently, several authors have considered problems with more complicated domains (see for example McCormick's AFAC method (1989) and Baden et al. (1994)). However, these methods still use structured grids. In this paper we present a program which is based upon unstructured grids. By allowing unstructured grids we can solve problems on more general regions and use adaptive refinement methods.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Adaptive multigrid in parallel\",\"authors\":\"L. Stals\",\"doi\":\"10.1109/ICAPP.1995.472269\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Early experiments with parallel multigrid used square domains and uniform grids. More recently, several authors have considered problems with more complicated domains (see for example McCormick's AFAC method (1989) and Baden et al. (1994)). However, these methods still use structured grids. In this paper we present a program which is based upon unstructured grids. By allowing unstructured grids we can solve problems on more general regions and use adaptive refinement methods.<<ETX>>\",\"PeriodicalId\":448130,\"journal\":{\"name\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAPP.1995.472269\",\"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 1st International Conference on Algorithms and Architectures for Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAPP.1995.472269","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
摘要
早期的平行多重网格实验使用的是方形域和均匀网格。最近，一些作者考虑了更复杂领域的问题(例如McCormick的AFAC方法(1989)和Baden et al.(1994))。然而，这些方法仍然使用结构化网格。本文提出了一个基于非结构化网格的程序。通过允许非结构化网格，我们可以在更一般的区域解决问题，并使用自适应细化方法。
Early experiments with parallel multigrid used square domains and uniform grids. More recently, several authors have considered problems with more complicated domains (see for example McCormick's AFAC method (1989) and Baden et al. (1994)). However, these methods still use structured grids. In this paper we present a program which is based upon unstructured grids. By allowing unstructured grids we can solve problems on more general regions and use adaptive refinement methods.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
