{"title":"SPARSPAK的新版本:滑铁卢稀疏矩阵包","authors":"A. George, E. Ng","doi":"10.1145/1057931.1057933","DOIUrl":null,"url":null,"abstract":"Large sparse matrix problems arise frequently in many scientific and engineering computations. In order to solve these problems efficiently, both in terms of execution time and storage requirement, complicated storage management and data structures are usually required. However, if solving a sparse matrix problem is the prime objective, it is undesirable to have to understand the sophisticated techniques employed before the problem can be solved. Thus it is important to have software packages for solving large sparse matrix problems that provide a set of interface subroutines which insulate the users from the complicated internal structures.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1984-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"A new release of SPARSPAK: the Waterloo sparse matrix package\",\"authors\":\"A. George, E. Ng\",\"doi\":\"10.1145/1057931.1057933\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Large sparse matrix problems arise frequently in many scientific and engineering computations. In order to solve these problems efficiently, both in terms of execution time and storage requirement, complicated storage management and data structures are usually required. However, if solving a sparse matrix problem is the prime objective, it is undesirable to have to understand the sophisticated techniques employed before the problem can be solved. Thus it is important to have software packages for solving large sparse matrix problems that provide a set of interface subroutines which insulate the users from the complicated internal structures.\",\"PeriodicalId\":177516,\"journal\":{\"name\":\"ACM Signum Newsletter\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1984-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Signum Newsletter\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1057931.1057933\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Signum Newsletter","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1057931.1057933","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new release of SPARSPAK: the Waterloo sparse matrix package
Large sparse matrix problems arise frequently in many scientific and engineering computations. In order to solve these problems efficiently, both in terms of execution time and storage requirement, complicated storage management and data structures are usually required. However, if solving a sparse matrix problem is the prime objective, it is undesirable to have to understand the sophisticated techniques employed before the problem can be solved. Thus it is important to have software packages for solving large sparse matrix problems that provide a set of interface subroutines which insulate the users from the complicated internal structures.