A Hybrid Ordering Scheme for Efficient Sparse Cholesky Factorization

摘要：

When applying Cholesky factorization method to solving sparse symmetric positive definite system Ax=b, two classes of ordering algorithms are widely used to reduce the amount of fill. In view of their respective advantages and disadvantages, a parallel hybrid ordering scheme is proposed, which is proved to be effective by both theoretical analysis and parallel implementation. It is noteworthy that the algorithm can not only find a good ordering efficiently, but also achieve the result of symbolic factorization simultaneously.

关键词： Cholesky factorization hybrid ordering nested dissection lexicographic ordering symbolic factorization

作者: LuYao Zhenghua Wang Zongzhe Li Wei Cao YongxianWang

作者单位: School of Computer Science, National University of Defense Technology, Changsha, China

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer and Automation Engineering(ICCAE 2011)(2011年第三届IEEE计算机与自动化工程国际会议)

会议地点: 重庆

会议语种:英文

页码: 140-143

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