Domain Decomposition Methods in Science and Engineering XVIII

  • Michel Bercovier
  • Martin J. Gander
  • Ralf Kornhuber
  • Olof Widlund

Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 70)

Table of contents

  1. Front Matter
    Pages I-XVI
  2. Plenary Presentations

    1. Front Matter
      Pages 1-1
    2. Harbir Antil, Ronald H. W. Hoppe, Christopher Linsenmann
      Pages 15-26
    3. Ralf Hiptmair, Ilaria Perugia
      Pages 51-62
    4. Frédéric Hecht, Alexei Lozinski, Olivier Pironneau
      Pages 63-73
    5. Ray S. Tuminaro, Jinchao Xu, Yunrong Zhu
      Pages 99-109
  3. Minisymposia

About these proceedings

Introduction

th This volume contains a selection of 41 refereed papers presented at the 18 International Conference of Domain Decomposition Methods hosted by the School of ComputerScience and Engineering(CSE) of the Hebrew Universityof Jerusalem, Israel, January 12–17, 2008. 1 Background of the Conference Series The International Conference on Domain Decomposition Methods has been held in twelve countries throughout Asia, Europe, the Middle East, and North America, beginning in Paris in 1987. Originally held annually, it is now spaced at roughly 18-month intervals. A complete list of past meetings appears below. The principal technical content of the conference has always been mathematical, but the principal motivation has been to make ef cient use of distributed memory computers for complex applications arising in science and engineering. The leading 15 such computers, at the “petascale” characterized by 10 oating point operations per second of processing power and as many Bytes of application-addressablem- ory, now marshal more than 200,000 independentprocessor cores, and systems with many millions of cores are expected soon. There is essentially no alternative to - main decomposition as a stratagem for parallelization at such scales. Contributions from mathematicians, computerscientists, engineers,and scientists are together n- essary in addressing the challenge of scale, and all are important to this conference.

Keywords

Approximation Graph Information Matching algorithms complexity domain decomposition finite elements optimization parallel computing preconditioned conjugate gradients

Editors and affiliations

  • Michel Bercovier
    • 1
  • Martin J. Gander
    • 2
  • Ralf Kornhuber
    • 3
  • Olof Widlund
    • 4
  1. 1.School of Computer Science and EngineeringThe Hebrew University of JerusalemJerusalemIsrael
  2. 2.Section de mathématiquesUniversité de GenèveGenève 24Switzerland
  3. 3.Institut für MathematikFreie Universität BerlinBerlin-DahlemGermany
  4. 4.Courant InstituteNew YorkUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-02677-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-642-02676-8
  • Online ISBN 978-3-642-02677-5
  • Series Print ISSN 1439-7358
  • Series Online ISSN 2197-7100
  • About this book
Industry Sectors
Aerospace
Oil, Gas & Geosciences
Pharma