Domain decomposition of finite element models (FEM) for parallel computing are often performed using graph theory and algebraic graph theory. This paper aims to present a new method for such decomposition, where a combination of algebraic graph theory and differential equations is employed.
In the present method, a combination of graph theory and differential equations is employed. The proposed method transforms the eigenvalue problem involved in decomposing FEM by the algebraic graph method, into a specific initial value problem of an ordinary differential equation.
The transformation of this paper enables many advanced numerical methods for ordinary differential equations to be used in the computation of the eigenproblems.
Combining two different tools, namely algebraic graph theory and differential equations, results in an efficient and accurate method for decomposing the FEM which is a combinatorial optimization problem. Examples are included to illustrate the efficiency of the present method.
Kaveh, A., Laknegadi, K. and Zahedi, M. (2008), "A new algorithm for domain decomposition of finite element models", Engineering Computations, Vol. 25 No. 5, pp. 464-479. https://doi.org/10.1108/02644400810881392
Emerald Group Publishing Limited
Copyright © 2008, Emerald Group Publishing Limited