摘要
在科学与工程计算领域,有许多问题都最终归结为求解稀疏线性方程组;其稀疏矩阵中只有少量元素不为零,为了节省计算机的存储空间,加快存取运算速度,开展稀疏矩阵存储技术的研究是十分必要的。本文从基本的矩阵存储技术出发,介绍了一些常用的稀疏矩阵存储方法,比较了它们的优缺点,并给出了它们的适用条件。期望能够对稀疏线性方程组的高效求解提供一些有益帮助。
In the computational field of science and engineering, many problems finally go to solve sparse linear equations and the sparse matrix has a few nonzero elements. For saving storage of computer and quickening elements＇ operation, it is very necessary to study storage technique for sparse matrix. Based on basal storage technique for matrix, this paper introduces some common storage methods for sparse matrix. After analyzing advantages and disadvantages of the methods, we show applied conditions for them. It is anticipant to provide some availability ways about effective solution for sparse linear equations.
出处
《长春理工大学学报（自然科学版）》
2006年第3期38-41,共4页
Journal of Changchun University of Science and Technology(Natural Science Edition)
基金
国家自然科学基金资助(10477018)
关键词
稀疏线性方程组
稀疏矩阵
稀疏存储技术
sparse linear equation group
sparse matrix
sparse storage technique
