{"title":"平面椭圆网格生成方程的并行求解器","authors":"W. L. Golik","doi":"10.1080/10637199808947385","DOIUrl":null,"url":null,"abstract":"Numerical solution of elliptic grid generation equations requires iterative solution of large nonlinear algebraic systems, a computationally intensive task. To assist a selection of efficient and robust methods, this paper considers parallel implementations of several iterative grid generation solvers. The methods studied are multicolor SOR. multigrid, and GMRES. They are implemented on the MasPar MP-I, a massively parallel SIMD machine. The experiments suggest that multigrid methods are the most efficient and robust for large problems.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"PARALLEL SOLVERS FOR PLANAR ELLIPTIC GRID GENERATION EQUATIONS\",\"authors\":\"W. L. Golik\",\"doi\":\"10.1080/10637199808947385\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Numerical solution of elliptic grid generation equations requires iterative solution of large nonlinear algebraic systems, a computationally intensive task. To assist a selection of efficient and robust methods, this paper considers parallel implementations of several iterative grid generation solvers. The methods studied are multicolor SOR. multigrid, and GMRES. They are implemented on the MasPar MP-I, a massively parallel SIMD machine. The experiments suggest that multigrid methods are the most efficient and robust for large problems.\",\"PeriodicalId\":406098,\"journal\":{\"name\":\"Parallel Algorithms and Applications\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Parallel Algorithms and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/10637199808947385\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parallel Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/10637199808947385","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
PARALLEL SOLVERS FOR PLANAR ELLIPTIC GRID GENERATION EQUATIONS
Numerical solution of elliptic grid generation equations requires iterative solution of large nonlinear algebraic systems, a computationally intensive task. To assist a selection of efficient and robust methods, this paper considers parallel implementations of several iterative grid generation solvers. The methods studied are multicolor SOR. multigrid, and GMRES. They are implemented on the MasPar MP-I, a massively parallel SIMD machine. The experiments suggest that multigrid methods are the most efficient and robust for large problems.