基于稀疏矩阵存储结构的H-矩阵迭代判定算法的实现

Realization of an Iterative Criterion for-matrices Based on the Storage Structure of Sparse Matrices

本文针对文献[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.