Multifrontal Solver Combined with Graph Partitioners

Abstract

For large-scale structural analysis, the performance of a linear equation solver is very important for the overall efe ciency of the analysis code. The multifrontal solver is a very efe cient direct solver for e nite element analysis. By using multiple fronts, it can considerably reduce the computing time spent on solving the system of linear equations arising from e nite element analysis. To achieve good performance using the multifrontal solver, a good front partition must be obtained because the performance largely depends on the quality of the front partition, that is, the number of degrees of freedom on the partitioned fronts. In this study, graph-partitioning algorithms that are generally used to decompose a given domain for parallel computation are combined with the multifrontal solver to obtain good front partitions of irregular (unstructured )meshes. The ine uence of the partitioning quality on the performance of the multifrontal solver is also examined. For regular (structured) meshes, the multifrontal scheme can solve the system of linear equations much more efe ciently than the single frontal scheme with the help of a simple front-partitioning algorithm. For large-scale problems with irregular meshes such as the e nite element meshes of aerospace structures, the verie cation was made that the developed multifrontal solver combined with an efe cient graph partitioner (Metis) and an appropriate mesh mapping scheme (weighted-edge mapping ) shows very good performance.