{"title":"大型稀疏矩阵线性方程的存储与求解","authors":"Chao Liu, Junmin Ye, Yining Ma","doi":"10.1109/ICCIS.2012.293","DOIUrl":null,"url":null,"abstract":"Solving of large sparse matrix linear equations is always the research focus of scientific and engineering calculation field. With the sparsity and symmetry characteristics of coefficient matrix, Compressed Sparse Row (CSR) is adopted in the storage of large sparse matrix linear equations. Under the condition of CSR, Symmetrica Successive Over Relaxations-Preconditioned Conjugate Gradient method (SSOR-PCG) is employed in the solution of large sparse matrix linear equations.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Storage and Solving of Large Sparse Matrix Linear Equations\",\"authors\":\"Chao Liu, Junmin Ye, Yining Ma\",\"doi\":\"10.1109/ICCIS.2012.293\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Solving of large sparse matrix linear equations is always the research focus of scientific and engineering calculation field. With the sparsity and symmetry characteristics of coefficient matrix, Compressed Sparse Row (CSR) is adopted in the storage of large sparse matrix linear equations. Under the condition of CSR, Symmetrica Successive Over Relaxations-Preconditioned Conjugate Gradient method (SSOR-PCG) is employed in the solution of large sparse matrix linear equations.\",\"PeriodicalId\":269967,\"journal\":{\"name\":\"2012 Fourth International Conference on Computational and Information Sciences\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fourth International Conference on Computational and Information Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIS.2012.293\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Computational and Information Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIS.2012.293","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Storage and Solving of Large Sparse Matrix Linear Equations
Solving of large sparse matrix linear equations is always the research focus of scientific and engineering calculation field. With the sparsity and symmetry characteristics of coefficient matrix, Compressed Sparse Row (CSR) is adopted in the storage of large sparse matrix linear equations. Under the condition of CSR, Symmetrica Successive Over Relaxations-Preconditioned Conjugate Gradient method (SSOR-PCG) is employed in the solution of large sparse matrix linear equations.