Computational Technology Resources - CSETS

P.K. Jimack, D.C. Hodgson, "Parallel Preconditioners based upon Domain Decomposition", in B.H.V. Topping, (Editor), "Parallel and Distributed Processing for Computational Mechanics: Systems and Tools", Saxe-Coburg Publications, Stirlingshire, UK, Chapter 10, pp 207-223, 1999. doi:10.4203/csets.2.10

Abstract

Domain-decomposition methods have been studied and applied to the solution of engineering problems for many years. Recent advances in parallel computing systems have rekindled interest in these methods, at least in part due to the obvious parallelism that is apparent in such algorithms. This paper briefly reviews a number of different domain-decomposition algorithms and shows how they may be used in conjunction with iterative solution techniques for the solution of linear systems of equations arising in the finite element solution of computational mechanics problems. Particular emphasis is placed on so-called iterative substructuring algorithms, in which non-overlapping subdomains are used, and details of how to produce efficient parallel implementations are included.

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

go to the previous chapter
go to the next chapter
return to the table of contents
return to the book description
purchase this book (price £95 +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	Computational Science, Engineering & Technology Series ISSN 1759-3158 CSETS: 2 PARALLEL AND DISTRIBUTED PROCESSING FOR COMPUTATIONAL MECHANICS: SYSTEMS AND TOOLS Edited by: B.H.V. Topping Chapter 10 Parallel Preconditioners based upon Domain Decomposition P.K. Jimack and D.C. Hodgson School of Computer Studies, University of Leeds, Leeds, United Kingdom doi:10.4203/csets.2.10 purchase the full-text of this chapter Full Bibliographic Reference for this chapter P.K. Jimack, D.C. Hodgson, "Parallel Preconditioners based upon Domain Decomposition", in B.H.V. Topping, (Editor), "Parallel and Distributed Processing for Computational Mechanics: Systems and Tools", Saxe-Coburg Publications, Stirlingshire, UK, Chapter 10, pp 207-223, 1999. doi:10.4203/csets.2.10 Abstract Domain-decomposition methods have been studied and applied to the solution of engineering problems for many years. Recent advances in parallel computing systems have rekindled interest in these methods, at least in part due to the obvious parallelism that is apparent in such algorithms. This paper briefly reviews a number of different domain-decomposition algorithms and shows how they may be used in conjunction with iterative solution techniques for the solution of linear systems of equations arising in the finite element solution of computational mechanics problems. Particular emphasis is placed on so-called iterative substructuring algorithms, in which non-overlapping subdomains are used, and details of how to produce efficient parallel implementations are included. purchase the full-text of this chapter (price £20) go to the previous chapter go to the next chapter return to the table of contents return to the book description purchase this book (price £95 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions