A wrapper around parallel MUMPS solver to reduce its memory usage and execution time for finite element method computations

Abstract In this paper, we present a wrapper around MUMPS solver, called Hierarchical Solver Wrapper (HSW), that is tailored to domain decomposition-based parallel finite element method computations on distributed memory systems. It offers the same interface as parallel MUMPS with matrix entries in coordinate format provided in a distributed fashion among multiple processors. The algorithm implemented by the wrapper utilizes multiple sequential instances of MUMPS solver to compute Schur complements over subdomains. Next, it deallocates sequential MUMPS solvers and LU factors, and it calls the parallel MUMPS solver feeded with the Schur complements, stored in distributed manner. In the backward substitution stage it recomputes the local LU factors before solving the local problems. The wrapper has been tested with three-dimensional isogeometric analysis computations, and we show it reduces both the memory usage and the execution time, in comparison with a single parallel MUMPS call.

[1]  J. T. Oden,et al.  A parallel multifrontal algorithm and its implementation , 1997 .

[2]  Pinar Heggernes,et al.  The Computational Complexity of the Minimum Degree Algorithm , 2001 .

[3]  Iain S. Duff,et al.  The Multifrontal Solution of Unsymmetric Sets of Linear Equations , 1984 .

[4]  Jean-Yves L'Excellent,et al.  Improving Multifrontal Methods by Means of Block Low-Rank Representations , 2015, SIAM J. Sci. Comput..

[5]  Diego Paredes,et al.  A family of Multiscale Hybrid-Mixed finite element methods for the Darcy equation with rough coefficients , 2013, J. Comput. Phys..

[6]  Jürgen Schulze.  Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse Matrix Ordering Methods , 2001 .

[7]  CHRISTOPHER HARDER,et al.  On a Multiscale Hybrid-Mixed Method for Advective-Reactive Dominated Problems with Heterogeneous Coefficients , 2015, Multiscale Model. Simul..

[8]  Patrick R. Amestoy,et al.  An Approximate Minimum Degree Ordering Algorithm , 1996, SIAM J. Matrix Anal. Appl..

[9]  John K. Reid,et al.  The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.

[10]  Jean-Yves L'Excellent,et al.  On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment , 2012, SIAM J. Sci. Comput..

[11]  Robert E. Tarjan,et al.  Graph Clustering and Minimum Cut Trees , 2004, Internet Math..

[12]  Thomas J. R. Hughes,et al.  Isogeometric Analysis: Toward Integration of CAD and FEA , 2009 .

[13]  T. Hughes,et al.  Isogeometric analysis : CAD, finite elements, NURBS, exact geometry and mesh refinement , 2005 .

[14]  Patrick R. Amestoy,et al.  Multifrontal parallel distributed symmetric and unsymmetric solvers , 2000 .

[15]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..