{"title":"合并Jacobi和Gauss-Seidel方法求解计算机集群上的马尔可夫链","authors":"J. Bylina, B. Bylina","doi":"10.1109/IMCSIT.2008.4747250","DOIUrl":null,"url":null,"abstract":"The authors consider the use of the parallel iterative methods for solving large sparse linear equation systems resulting from Markov chains-on a computer cluster. A combination of Jacobi and Gauss-Seidel iterative methods is examined in a parallel version. Some results of experiments for sparse systems with over 3 times 107 equations and about 2 times 108 nonzeros which we obtained from a Markovian model of a congestion control mechanism are reported.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Merging Jacobi and Gauss-Seidel methods for solving Markov chains on computer clusters\",\"authors\":\"J. Bylina, B. Bylina\",\"doi\":\"10.1109/IMCSIT.2008.4747250\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors consider the use of the parallel iterative methods for solving large sparse linear equation systems resulting from Markov chains-on a computer cluster. A combination of Jacobi and Gauss-Seidel iterative methods is examined in a parallel version. Some results of experiments for sparse systems with over 3 times 107 equations and about 2 times 108 nonzeros which we obtained from a Markovian model of a congestion control mechanism are reported.\",\"PeriodicalId\":267715,\"journal\":{\"name\":\"2008 International Multiconference on Computer Science and Information Technology\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Multiconference on Computer Science and Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMCSIT.2008.4747250\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Multiconference on Computer Science and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMCSIT.2008.4747250","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Merging Jacobi and Gauss-Seidel methods for solving Markov chains on computer clusters
The authors consider the use of the parallel iterative methods for solving large sparse linear equation systems resulting from Markov chains-on a computer cluster. A combination of Jacobi and Gauss-Seidel iterative methods is examined in a parallel version. Some results of experiments for sparse systems with over 3 times 107 equations and about 2 times 108 nonzeros which we obtained from a Markovian model of a congestion control mechanism are reported.