An Efficient Parallelization Strategy For The Adaptive Integral Method Based On Graph Partitioning

Author(s):  
Damian Marek ◽  
Shashwat Sharma ◽  
Piero Triverio
1994 ◽  
Vol 20 (1) ◽  
pp. 63-75 ◽  
Author(s):  
Thomas Schreiber ◽  
Peter Otto ◽  
Fridolin Hofmann

Mathematics ◽  
2021 ◽  
Vol 9 (24) ◽  
pp. 3278
Author(s):  
Petr Pařík ◽  
Jin-Gyun Kim ◽  
Martin Isoz ◽  
Chang-uk Ahn

The enhanced Craig–Bampton (ECB) method is a novel extension of the original Craig–Bampton (CB) method, which has been widely used for component mode synthesis (CMS). The ECB method, using residual modal compensation that is neglected in the CB method, provides dramatic accuracy improvement of reduced matrices without an increasing number of eigenbasis. However, it also needs additional computational requirements to treat the residual flexibility. In this paper, an efficient parallelization of the ECB method is presented to handle this issue and accelerate the applicability for large-scale structural vibration problems. A new ECB formulation within a substructuring strategy is derived to achieve better scalability. The parallel implementation is based on OpenMP parallel architecture. METIS graph partitioning and Linear Algebra Package (LAPACK) are used to automated algebraic partitioning and computational linear algebra, respectively. Numerical examples are presented to evaluate the accuracy, scalability, and capability of the proposed parallel ECB method. Consequently, based on this work, one can expect effective computation of the ECB method as well as accuracy improvement.


Sign in / Sign up

Export Citation Format

Share Document