Domain Decomposition (häftad)
Format
Häftad (Paperback)
Språk
Engelska
Antal sidor
240
Utgivningsdatum
2004-03-01
Upplaga
New e.
Förlag
Cambridge University Press
Medarbetare
Bjorstad, Petter / Gropp, William
Illustrationer
46d.2tabs.
Dimensioner
245 x 183 x 13 mm
Vikt
436 g
Antal komponenter
1
Komponenter
50:B&W 7.44 x 9.69 in or 246 x 189 mm (Crown 4vo) Perfect Bound on White w/Gloss Lam
ISBN
9780521602860

Domain Decomposition

Parallel Multilevel Methods for Elliptic Partial Differential Equations

Häftad,  Engelska, 2004-03-01
707
  • Skickas från oss inom 7-10 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
This book presents an easy-to-read discussion of domain decomposition algorithms, their implementation and analysis. The relationship between domain decomposition and multigrid methods is carefully explained at an elementary level, and discussions of the implementation of domain decomposition methods on massively parallel super computers are also included. All algorithms are fully described and explained, and a mathematical framework for the analysis and complete understanding of the methods is also carefully developed. In addition, numerous numerical examples are included to demonstrate the behaviour of this important class of numerical methods. This book is ideal for graduate students about to embark on a career in computational science. It will also be a valuable resource for all those interested in parallel computing and numerical computational methods.
Visa hela texten

Passar bra ihop

  1. Domain Decomposition
  2. +
  3. The Anxious Generation

De som köpt den här boken har ofta också köpt The Anxious Generation av Jonathan Haidt (inbunden).

Köp båda 2 för 996 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av Barry Smith

Recensioner i media

'This book presents an easy-to-read discussion of domain decomposition algorithms, their implementation and analysis ... All algorithms are fully described and explained, and a mathematical framework for the analysis and complete understanding of the methods is also carefully developed.' L'Enseignement Mathmatique

Innehållsförteckning

1. One level algorithms; 2. Two level algorithms; 3. Multilevel algorithms; 4. Substructuring methods; 5. A convergence theory; Appendix 1; Appendix 2; Bibliography.