.png){kind=icon}
返回
A HYPERGRAPH PARTITIONING MODEL FOR PROFILE MINIMIZATION
.png){kind=icon}
OA
AI
DOI：10.1137/17M1161245.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, the aim is to symmetrically permute the rows and columns of a given sparse symmetric matrix so that the profile of the permuted matrix is minimized. We formulate this permutation problem by first defining the m-way ordered hypergraph partitioning (moHP) problem and then showing the correspondence between profile minimization and moHP problems. For solving the moHP problem, we propose a recursive-bipartitioning-based hypergraph partitioning algorithm, which we refer to as the moHP algorithm. This algorithm achieves a linear part ordering via left-toright bipartitioning. In this algorithm, we utilize fixed vertices and two novel cut-net manipulation techniques in order to address the minimization objective of the moHP problem. We show the correctness of the moHP algorithm and describe how the existing partitioning tools can be utilized for its implementation. Experimental results on an extensive set of matrices show that the moHP algorithm obtains a smaller profile than the state-of-the-art profile reduction algorithms, which then results in considerable improvements in the factorization runtime in a direct solver.
Keyword:
sparse matrices
matrix ordering
matrix profile
matrix envelope
profile minimization
profile reduction
hypergraph partitioning
recursive bipartitioning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Modification of a commercial DNA extraction kit for safe and rapid recovery of DNA and RNA simultaneously from soil, without the use of harmful solvents.png)
MethodsXOAAI
MethodsXIF0
OAAI分享收藏分享收藏分享收藏
查看更多内容