Abstract
The multifrontal solver is a very efficient direct solver for finite element analysis. By using multiple fronts, it can considerably reduce computing time spent on solving the system of linear equations arising from finite element analysis. In order to achieve good performance using the multifrontal solver , good frontpartitioning must be obtained since the performance largely depends on the quality of front-partiti oning, in other words, the number of degrees of freedom(DOFs) on the partitioned fronts. The efficiency of the multifrontal solver with respect to the number of fronts is shown for the problems with regular finite element meshes. Graph partitioning algorithm which is generally used to divide domain for parallel computing is combined with the multifrontal solver to obtain frontpartitioning of irregular meshes. The influence of the partitioning quality on the performance of the multifrontal solver is examined. The multifrontal solver combined with graph or mesh partitioner shows much better performance than a single frontal solver with spectral element reordering for large size of problems with irregular meshes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
