{"title":"块可矢量预条件迭代方法","authors":"Liu Xing-ping, Hu Jia-Gan","doi":"10.1080/10637199408962540","DOIUrl":null,"url":null,"abstract":"ABSTRACT In this paper the algorithms of the Block Vectorizable Preconditioned iterative Method for linear systems of the form A× = f are proposed, when A is block tridiagonal matrix. The convergence of these iterative methods is analysed, when A is an M matrix or H matrix- The resulting BVPI method has been tested on a YH-1 computer. Numerical examples indicates that the new method is very efficient, since the vectorial computational can be applied.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"BLOCK VECTORIZABLE PRECONDITIONED ITERATIVE METHODS\",\"authors\":\"Liu Xing-ping, Hu Jia-Gan\",\"doi\":\"10.1080/10637199408962540\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT In this paper the algorithms of the Block Vectorizable Preconditioned iterative Method for linear systems of the form A× = f are proposed, when A is block tridiagonal matrix. The convergence of these iterative methods is analysed, when A is an M matrix or H matrix- The resulting BVPI method has been tested on a YH-1 computer. Numerical examples indicates that the new method is very efficient, since the vectorial computational can be applied.\",\"PeriodicalId\":406098,\"journal\":{\"name\":\"Parallel Algorithms and Applications\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-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/10637199408962540\",\"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/10637199408962540","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ABSTRACT In this paper the algorithms of the Block Vectorizable Preconditioned iterative Method for linear systems of the form A× = f are proposed, when A is block tridiagonal matrix. The convergence of these iterative methods is analysed, when A is an M matrix or H matrix- The resulting BVPI method has been tested on a YH-1 computer. Numerical examples indicates that the new method is very efficient, since the vectorial computational can be applied.