Computational Technology Resources - CCP

Paper VII.4

A Mixed Method for Subdomain Generation for Parallel Processing

A. Kaveh and A. Davaran

Building and Housing Research Centre, Tehran, Iran and Iran University of Science and Technology, Tehran, Iran

doi:10.4203/ccp.38.7.4

A. Kaveh, A. Davaran, "A Mixed Method for Subdomain Generation for Parallel Processing", in B.H.V. Topping, (Editor), "Advances in Computational Structures Technology", Civil-Comp Press, Edinburgh, UK, pp 259-264, 1996. doi:10.4203/ccp.38.7.4

Abstract

A mixed method is presented for domain decomposition employing combinatorial and algebraic graph theoretical algorithms. The method uses combinatorial graph theory for partial decomposition, followed by an 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 the mixed method is also investigated.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £82 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 38 ADVANCES IN COMPUTATIONAL STRUCTURES TECHNOLOGY Edited by: B.H.V. Topping Paper VII.4 A Mixed Method for Subdomain Generation for Parallel Processing A. Kaveh and A. Davaran Building and Housing Research Centre, Tehran, Iran and Iran University of Science and Technology, Tehran, Iran doi:10.4203/ccp.38.7.4 purchase the full-text of this paper Full Bibliographic Reference for this paper A. Kaveh, A. Davaran, "A Mixed Method for Subdomain Generation for Parallel Processing", in B.H.V. Topping, (Editor), "Advances in Computational Structures Technology", Civil-Comp Press, Edinburgh, UK, pp 259-264, 1996. doi:10.4203/ccp.38.7.4 Abstract A mixed method is presented for domain decomposition employing combinatorial and algebraic graph theoretical algorithms. The method uses combinatorial graph theory for partial decomposition, followed by an 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 the mixed method is also investigated. purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £82 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions