Computational Technology Resources - CSETS

T. Miyamura

Department of Computer Science, College of Engineering, Nihon University, Fukushima, Japan

doi:10.4203/csets.24.7

T. Miyamura, "Incorporation of Multipoint Constraints into Domain Decomposition Methods", in F. Magoulès, (Editor), "Substructuring Techniques and Domain Decomposition Methods", Saxe-Coburg Publications, Stirlingshire, UK, Chapter 7, pp 171-202, 2010. doi:10.4203/csets.24.7

Keywords: balancing domain decomposition, multipoint constraint, finite element method, conjugate projected gradient method, coarse grid correction, parallel computing.

Abstract

The domain decomposition method (DDM) is a major solution algorithm for large-scale finite element analyses. The balancing domain decomposition (BDD) method is an efficient substructuring-based iterative linear solver. In this chapter, a method by which to incorporate a set of linear multipoint constraints (MPCs) into the BDD method is described.

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

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: 24 SUBSTRUCTURING TECHNIQUES AND DOMAIN DECOMPOSITION METHODS Edited by: F. Magoulès Chapter 7 Incorporation of Multipoint Constraints into Domain Decomposition Methods T. Miyamura Department of Computer Science, College of Engineering, Nihon University, Fukushima, Japan doi:10.4203/csets.24.7 purchase the full-text of this chapter Full Bibliographic Reference for this chapter T. Miyamura, "Incorporation of Multipoint Constraints into Domain Decomposition Methods", in F. Magoulès, (Editor), "Substructuring Techniques and Domain Decomposition Methods", Saxe-Coburg Publications, Stirlingshire, UK, Chapter 7, pp 171-202, 2010. doi:10.4203/csets.24.7 Keywords: balancing domain decomposition, multipoint constraint, finite element method, conjugate projected gradient method, coarse grid correction, parallel computing. Abstract The domain decomposition method (DDM) is a major solution algorithm for large-scale finite element analyses. The balancing domain decomposition (BDD) method is an efficient substructuring-based iterative linear solver. In this chapter, a method by which to incorporate a set of linear multipoint constraints (MPCs) into the BDD method is described. purchase the full-text of this chapter (price £25) 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