An Improved Independent Set Ordering Algorithm for Solving Large-scale Sparse Linear Systems

摘要：

The independent set ordering algorithm is a heuristic algorithm based on finding maximal independent sets of vertices in the matrix adjacency graph, which is commonly used for parallel matrix factorization. However, Disadvantages appear when it is applied to large-scale sparse linear systems. In this paper, we propose an improved algorithm by finding an optimal size of independent set in each elimination step rather than find a maximal independent set, which is proved to be effective by both theoretical analysis and parallel implementation.

关键词： independent set parallel LU decomposition large-scale sparse linear systems matrix ordering

作者: Lu Yao Wei Cao Zongzhe Li Yongxian Wang Zhenghua Wang

作者单位: National Key Lab for Parallel and Distributed Processing,National Univ.of Defense Technology,Changsha,China

会议类型: 国际会议

会议名称: 2010 Second International Conference on Intelligent Human-Machine Systems and Cybernetics(第二届智能人机系统与控制论国际学术会议 IHMSC 2010)

会议地点: 南京

会议语种:英文

页码: 178-181

在线出版日期: 2010-08-26（万方平台首次上网日期，不代表论文的发表时间）