Author:
Kaveh A.,Laknegadi K.,Zahedi M.
Abstract
PurposeDomain 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.Design/methodology/approachIn 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.FindingsThe transformation of this paper enables many advanced numerical methods for ordinary differential equations to be used in the computation of the eigenproblems.Originality/valueCombining 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.
Subject
Computational Theory and Mathematics,Computer Science Applications,General Engineering,Software
Reference26 articles.
1. Al‐Nasra, M. and Nguyen, D.T. (1991), “An algorithm for domain decomposition in finite element analysis”, Computers & Structures, Vol. 39, pp. 277‐89.
2. Chandrupatla, T.R. and Belegundu, A. (1997), Introduction to Finite Elements in Engineering, Prentice‐Hall, Englewood Cliffs, NJ.
3. Cvetković, D.M., Dobb, M. and Sachs, H. (1980), Spectra of Graphs, Academic Press, New York, NY.
4. Farhat, C. (1988), “A simple and efficient automatic FEM domain decomposer”, Computers & Structures, Vol. 28, pp. 579‐602.
5. Fiedler, M. (1973), “Algebraic connectivity of graphs”, Czechoslovak Mathematical Journal, Vol. 23, pp. 298‐305.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献