{"title":"并行计算的定位策略","authors":"Zhang Baolin","doi":"10.1080/10637199608915574","DOIUrl":null,"url":null,"abstract":"The concept of localization strategy for massively parallel algorithm is presented in the paper, A massively parallel algorithm of the numerical solution of some tridiagonal systems is considered by analyzing the possibility of localization computing. The algorithm can be used in the practical computation of cubic spline approximation as well as for solving some finite difference equations.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"LOCALIZATION STRATEGY FOR PARALLEL COMPUTING\",\"authors\":\"Zhang Baolin\",\"doi\":\"10.1080/10637199608915574\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The concept of localization strategy for massively parallel algorithm is presented in the paper, A massively parallel algorithm of the numerical solution of some tridiagonal systems is considered by analyzing the possibility of localization computing. The algorithm can be used in the practical computation of cubic spline approximation as well as for solving some finite difference equations.\",\"PeriodicalId\":406098,\"journal\":{\"name\":\"Parallel Algorithms and Applications\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Parallel Algorithms and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/10637199608915574\",\"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/10637199608915574","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The concept of localization strategy for massively parallel algorithm is presented in the paper, A massively parallel algorithm of the numerical solution of some tridiagonal systems is considered by analyzing the possibility of localization computing. The algorithm can be used in the practical computation of cubic spline approximation as well as for solving some finite difference equations.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
