摘要
分析了用分层的方法减小稀疏矩阵带宽的不足，产生这些不足的原因主要是分层的深度不一定为最大，而且层之间的宽度相差太大，为此对算法的分层进行了细化，把宽度大的分层上的节点移到宽度小的分层上去，使得分层之间的节点数更加均匀．改进后的算法稳定性增强．
The disadvantages for the layers used in reducing bandwidth of sparse matrix are analyzed. The reasons for these disadvantages are that the depth of layer is not always the maximum exactly and there is great difference in width between layers. The layers are refined. The nodes are moved from layers with great widths to those with small widths to make the widths as equal as possible. The stability of the algorithms is enhanced after the improvement.
出处
《华中理工大学学报》
CSCD
北大核心
1998年第12期43-45,共3页
Journal of Huazhong University of Science and Technology
基金
国家自然科学基金
国家教委博士点基金
关键词
稀疏矩阵
带宽
有限元
图论
sparse matrix
bandwidth reduction
graph
