Computational Technology Resources - CSETS

L. Giraud¹ and R.S. Tuminaro²

¹Parallel Algorithms and Optimization Group, LIMA-IRIT (UMR CNRS 5505), ENSEEIHT, Toulouse, France
²Computation, Computers and Mathematics Center, Sandia National Laboratories, Livermore CA, United States of America

doi:10.4203/csets.17.8

purchase the full-text of this chapter

L. Giraud, R.S. Tuminaro, "Algebraic Domain Decomposition Preconditioners", in F. Magoulès, (Editor), "Mesh Partitioning Techniques and Domain Decomposition Methods", Saxe-Coburg Publications, Stirlingshire, UK, Chapter 8, pp 189-218, 2007. doi:10.4203/csets.17.8

Keywords: algebraic preconditioners, matrix partitioning, mesh partitioning, overlapping techniques, non-overlapping approaches, two-level preconditioning.

Abstract

In this chapter, some popular and well-known domain decomposition preconditioners are described from an algebraic perspective. Specific emphasis is given to techniques that are well-suited to the parallel solution of large-scale scientific applications and industrial numerical simulations. Some computational aspects related to their parallel implementation are also addressed. This chapter is not intended for specialists in domain decomposition but rather for scientists who have some knowledge of linear algebra and discretisation techniques and who would like an introduction to domain decomposition.

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: 17 MESH PARTITIONING TECHNIQUES AND DOMAIN DECOMPOSITION METHODS Edited by: F. Magoulès Chapter 8 Algebraic Domain Decomposition Preconditioners L. Giraud¹ and R.S. Tuminaro² ¹Parallel Algorithms and Optimization Group, LIMA-IRIT (UMR CNRS 5505), ENSEEIHT, Toulouse, France ²Computation, Computers and Mathematics Center, Sandia National Laboratories, Livermore CA, United States of America doi:10.4203/csets.17.8 purchase the full-text of this chapter Full Bibliographic Reference for this chapter L. Giraud, R.S. Tuminaro, "Algebraic Domain Decomposition Preconditioners", in F. Magoulès, (Editor), "Mesh Partitioning Techniques and Domain Decomposition Methods", Saxe-Coburg Publications, Stirlingshire, UK, Chapter 8, pp 189-218, 2007. doi:10.4203/csets.17.8 Keywords: algebraic preconditioners, matrix partitioning, mesh partitioning, overlapping techniques, non-overlapping approaches, two-level preconditioning. Abstract In this chapter, some popular and well-known domain decomposition preconditioners are described from an algebraic perspective. Specific emphasis is given to techniques that are well-suited to the parallel solution of large-scale scientific applications and industrial numerical simulations. Some computational aspects related to their parallel implementation are also addressed. This chapter is not intended for specialists in domain decomposition but rather for scientists who have some knowledge of linear algebra and discretisation techniques and who would like an introduction to domain decomposition. 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