A hybrid method for domain decomposition in parallel computing
Editorial
10.22099/ijstm.2013.1014
Abstract
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.
(2013). A hybrid method for domain decomposition in parallel computing. Iranian Journal of Science and Technology Transactions of Mechanical Engineering, 24(3), 321-332. doi: 10.22099/ijstm.2013.1014
MLA
. "A hybrid method for domain decomposition in parallel computing", Iranian Journal of Science and Technology Transactions of Mechanical Engineering, 24, 3, 2013, 321-332. doi: 10.22099/ijstm.2013.1014
HARVARD
(2013). 'A hybrid method for domain decomposition in parallel computing', Iranian Journal of Science and Technology Transactions of Mechanical Engineering, 24(3), pp. 321-332. doi: 10.22099/ijstm.2013.1014
VANCOUVER
A hybrid method for domain decomposition in parallel computing. Iranian Journal of Science and Technology Transactions of Mechanical Engineering, 2013; 24(3): 321-332. doi: 10.22099/ijstm.2013.1014
)