摘要
本文针对文献[1]中的H-矩阵迭代判定算法,提出了适用于此算法的稀疏矩阵的存储结构,并用C语言实现了基于该存储结构的稀疏—矩阵判定算法.运用该存储结构的迭代算法判定大型稀疏矩阵节省了存储空间,提高了运算速度.
In this paper, the storage structure of sparse matrices is proposed for the iterative criterion of H- matrices in [ 1 ]. The iterative algorithm for sparse H- matrices based on the storage structure is implemented by computer language C. This algorithm increases the speed of implementation and saves memories in the case of large sparse matrices.
出处
《山西师范大学学报(自然科学版)》
2009年第4期19-22,共4页
Journal of Shanxi Normal University(Natural Science Edition)
基金
山西省自然科学基金(2006011006)
太原理工大学青年基金
关键词
稀疏矩阵
H-矩阵
存储结构
迭代判定
sparse matrices
H- matrices
storage structure
iterative criterioni