稀疏矩阵存储算法的探讨  

Storage Algorithm of Sparse Matrix

作　　者：秦体恒[1] 李学相[2] 安学庆[2] 

机构地区：[1]河南机电高等专科学校,河南新乡453002 [2]郑州大学,河南郑州450002

出　　处：《河南机电高等专科学校学报》2008年第1期91-92,共2页Journal of Henan Mechanical and Electrical Engineering College

基　　金：河南省自然科学基金资助课题(200311010500)

摘　　要：很多实际应用问题经常被归结为稀疏矩阵的计算,文中讨论了稀疏矩阵的压缩存储算法,稀疏矩阵中的元素采用三元组表示法作为它的存储结构。Many applied problems in practice can be summed up as the computation of sparse matrix. A storage algorithm about sparse matrix is discussed in this paper. A element of the sparse matrix is represented with a record in clude three fields, then all elements are represented with a array. The storage algorithm is better running efficiency.

关 键 词：稀疏矩阵 压缩存储算法 程序设计 

分 类 号：O241.6[理学—计算数学]