| 基于稀疏矩阵存储结构的H-矩阵迭代判定算法的实现 |
| |
| 引用本文： | 李雯,杨晋. 基于稀疏矩阵存储结构的H-矩阵迭代判定算法的实现[J]. 山西师范大学学报：自然科学版, 2009, 23(4): 19-22 |
| |
| 作者姓名： | 李雯 杨晋 |
| |
| 作者单位： | 太原理工大学理学院数学系,山西太原030024 |
| |
| 基金项目： | 山西省自然科学基金，太原理工大学青年基金 |
| |
| 摘 要： | 本文针对文献[1]中的H-矩阵迭代判定算法,提出了适用于此算法的稀疏矩阵的存储结构,并用C语言实现了基于该存储结构的稀疏—矩阵判定算法.运用该存储结构的迭代算法判定大型稀疏矩阵节省了存储空间,提高了运算速度.
|
| 关 键 词： | 稀疏矩阵 H-矩阵 存储结构 迭代判定 |
Realization of an Iterative Criterion for-matrices Based on the Storage Structure of Sparse Matrices |
| |
| LI Wen,YANG Jin. Realization of an Iterative Criterion for-matrices Based on the Storage Structure of Sparse Matrices[J]. Journal of Shanxi Teachers University, 2009, 23(4): 19-22 |
| |
| Authors: | LI Wen YANG Jin |
| |
| Affiliation: | ( Department of Mathematics, College of Science, Taiyuan University of Technology, Taiyuan 030024, Shanxi, China) |
| |
| Abstract: | 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. |
| |
| Keywords: | sparse matrices H- matrices storage structure iterative criterioni |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
