.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
sparse matrix ordering
parallel factorization
genetic algorithms
elimination tree
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
No organization information available
Cited Papers
High-Density Autologous Chondrocyte Implantation as Treatment for Ankle Osteochondral Defects.png)
CARTILAGE
OAAI
CARTILAGEIF0
OAAIShareSave
ShareSaveTwo‐Step Thermal Annealing: An Effective Route for 15 % Efficient Quasi‐2D Perovskite Solar CellsChemPlusChem
ChemPlusChemIF0
PREAI
ShareSaveShareSaveShareSave
View more