A hybrid method for domain decomposition in parallel computing

	A hybrid method for domain decomposition in parallel computing
Iranian Journal of Science and Technology Transactions of Mechanical Engineering
شناسنامه علمی شماره، دوره 24، شماره 3، اردیبهشت 2000، صفحه 321-332
شناسه دیجیتال (DOI): 10.22099/ijstm.2013.1014
چکیده
A hybrid method is presented for domain decomposition employing combinatorial and algebraic graph theoretical algorithms. The method uses combinatorial graph theory for partial decomposition, followed by a spectral bisection approach based on concepts from algebraic graph theory. Examples are presented to illustrate the efficiency of the mixed method. In this paper, the effects of nodal ordering on the performance of the spectral bisection and mixed method are investigated.
کلیدواژه‌ها
parallel computing؛ spectral bisection؛ Graph Theory؛ partitioning؛ hybrid method

آمار تعداد مشاهده مقاله: 1,865 تعداد دریافت فایل اصل مقاله: 9