.png){kind=icon}
返回
Improving parallel ordering of sparse matrices using genetic algorithms
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-005-4611-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the direct solution of sparse symmetric and positive definite linear systems, finding an ordering of the matrix to minimize the height of the elimination tree (an indication of the number of parallel elimination steps) is crucial for effectively computing the Cholesky factor in parallel. This problem is known to be NP-hard. Though many effective heuristics have been proposed, the problems of how good these heuristics are near optimal and how to further reduce the height of the elimination tree remain unanswered. This paper is an effort for this investigation. We introduce a genetic algorithm tailored to this parallel ordering problem, which is characterized by two novel genetic operators, adaptive merge crossover and tree rotate mutation. Experiments showed that our approach is cost effective in the number of generations evolved to reach a better solution in reducing the height of the elimination tree.
Keyword:
sparse matrix ordering
parallel factorization
genetic algorithms
elimination tree
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
暂无机构信息
引用论文
High-Density Autologous Chondrocyte Implantation as Treatment for Ankle Osteochondral Defects.png)
CARTILAGE
OAAI
CARTILAGEIF0
OAAI分享收藏
Two‐Step Thermal Annealing: An Effective Route for 15 % Efficient Quasi‐2D Perovskite Solar CellsChemPlusChem
ChemPlusChemIF0
PREAI
分享收藏分享收藏
查看更多内容