.png){kind=icon}
.png){kind=icon}
Return
Static load balancing applied to Schur complement method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compstruc.2006.08.025.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A finite element method often leads to large sparse symmetric and positive definite systems of linear equations. We consider parallel solvers based on the Schur complement method on homogeneous parallel machines with distributed memory. A finite element mesh is partitioned by graph partitioning. Such partitioning results in submeshes with similar numbers of elements and, consequently, submatrices of similar sizes. The submatrices are partially factorised. The time spent on the partial factorisation can be different, i.e., disbalanced, because methods exploiting the sparsity of submatrices are used. This paper proposes a Quality Balancing heuristic that modifies classic mesh partitioning so that the partial factorisation times are balanced, which saves overall computation time, especially for time dependent mechanical and nonstationary transport problems. (c) 2006 Elsevier Ltd. All rights reserved.
Keywords:
domain decomposition
finite element methods
mesh partitioning
multilevel graph partitioning
parallel solvers
static load balancing
schur complement niethod
time-dependent problerns
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.8
Papers:
6.2K
Citations:
1.7W
Organization
No organization information available