Implementing Sparse Matrix Ordering Using Hypergraph Partitioning

被引：0

作者：

Yao Lu ^{[1
]}

Yang Yi ^{[2
]}

Wang Zhenghua ^{[1
]}

Cao Wei ^{[1
]}

机构：

[1] Natl Univ Def Technol, Sch Comp, Changsha, Hunan, Peoples R China

[2] Troop, Lasa 77619, Peoples R China

来源：

MECHATRONICS AND INTELLIGENT MATERIALS III, PTS 1-3 | 2013年 / 706-708卷

基金：

中国国家自然科学基金;

关键词：

Matrix ordering; nested dissection; hypergraph partitioning;

D O I：

10.4028/www.scientific.net/AMR.706-708.1890

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Matrix ordering is a key technique when applying Cholesky factorization method to solving sparse symmetric positive definite system Ax = b. Much effort has been devoted to the development of powerful heuristic ordering algorithms. This paper implements a sparse matrix ordering scheme based on hypergraph partitioning. The novel nested dissection ordering scheme achieve the vertex separator by hypergraph partitioning. Experimental results show that the novel scheme produces results that are substantially better than METIS.

引用

页码：1890 / +

页数：2