Parallel multi-frontal solver for p adaptive finite element modeling of multi-physics computational problems |
| |
| Authors: | Maciej Paszyński David Pardo Anna Paszyńska |
| |
| Affiliation: | 1. Department of Computer Science, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Kraków, Poland;2. BCAM (Basque Center for Applied Mathematics) and IKERBASQUE (Basque Foundation for Sciences), Bizkaia Technology Park, Building 500, E-48160 Bilbao, Spain;3. Faculty of Physics, Astronomy and Applied Computer Science, Jagiellonian University, Reymonta 4, 30-059 Kraków, Poland;1. Department of Computer Science, Tsinghua University, Beijing, 100084, China;2. Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong;1. Institute for Applied Mathematics, University of Heidelberg, INF 294, 69120 Heidelberg, Germany;2. Institute for Computational Engineering and Sciences, The University of Texas at Austin, Austin, TX 78712, United States;1. School of Civil and Environmental Engineering, Georgia Institute of Technology, 790 Atlantic Drive, Atlanta, GA, 30332, USA;2. Dipartimento di Matematica e Applicazioni, Università di MilanoBicocca, Via Cozzi 53, I-20153, Milano, Italy |
| |
| Abstract: | The paper presents a parallel direct solver for multi-physics problems. The solver is dedicated for solving problems resulting from adaptive finite element method computations. The concept of finite element is actually replaced by the concept of the node. The computational mesh consists of several nodes, related to element vertices, edges, faces and interiors. The ordering of unknowns in the solver is performed on the level of nodes. The concept of the node can be efficiently utilized in order to recognize unknowns that can be eliminated at a given node of the elimination tree. The solver is tested on the exemplary three-dimensional multi-physics problem involving the computations of the linear acoustics coupled with linear elasticity. The three-dimensional tetrahedral mesh generation and the solver algorithm are modeled by using graph grammar formalism. The execution time and the memory usage of the solver are compared with the MUMPS solver. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
