Computational Technology Resources - CCP

J. Kruis and Z. Bittnar

Department of Structural Mechanics, Czech Technical University, Prague, Czech Republic

doi:10.4203/ccp.68.9.2

J. Kruis, Z. Bittnar, "Advantages of Parallel Algorithms in Structural Mechanics", in B.H.V. Topping, (Editor), "Developments in Engineering Computational Technology", Civil-Comp Press, Edinburgh, UK, pp 219-227, 2000. doi:10.4203/ccp.68.9.2

Abstract

Domain decomposition methods are powerful tools for solution of large sparse equation systems arising from finite element method, especially in connection with parallel computers. Two algorithms are described and compared on different types of parallel computers and operating systems. The first algorithm is primal domain decomposition method and the second is finite element tearing and interconnecting method. Definition of speedup is mentioned and discussed with respect to algorithms in structural mechanics. Several numerical examples are shown and analysed.

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 £75 +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: 68 DEVELOPMENTS IN ENGINEERING COMPUTATIONAL TECHNOLOGY Edited by: B.H.V. Topping Paper IX.2 Advantages of Parallel Algorithms in Structural Mechanics J. Kruis and Z. Bittnar Department of Structural Mechanics, Czech Technical University, Prague, Czech Republic doi:10.4203/ccp.68.9.2 purchase the full-text of this paper Full Bibliographic Reference for this paper J. Kruis, Z. Bittnar, "Advantages of Parallel Algorithms in Structural Mechanics", in B.H.V. Topping, (Editor), "Developments in Engineering Computational Technology", Civil-Comp Press, Edinburgh, UK, pp 219-227, 2000. doi:10.4203/ccp.68.9.2 Abstract Domain decomposition methods are powerful tools for solution of large sparse equation systems arising from finite element method, especially in connection with parallel computers. Two algorithms are described and compared on different types of parallel computers and operating systems. The first algorithm is primal domain decomposition method and the second is finite element tearing and interconnecting method. Definition of speedup is mentioned and discussed with respect to algorithms in structural mechanics. Several numerical examples are shown and analysed. 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 £75 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions