These are the proceedings of the 24th International Conference on Domain Decomposition Methods in Science and Engineering, which was held in Svalbard, Norway in February 2017. Domain decomposition methods are iterative methods for solving the often very large systems of equations that arise when engineering problems are discretized, frequently using finite elements or other modern techniques. These methods are specifically designed to make effective use of massively parallel, high-performance computing systems. The book presents both theoretical and computational advances in this domain, reflecting the state of art in 2017.

These are the proceedings of the 19th international conference on domain decomposition methods in science and engineering. Domain decomposition methods are iterative methods for solving the often very large linear or nonlinear systems of algebraic equations that arise in various problems in mathematics, computational science, engineering and industry. They are designed for massively parallel computers and take the memory hierarchy of such systems into account. This is essential for approaching peak floating point performance. There is an increasingly well-developed theory which is having a direct impact on the development and improvement of these algorithms.

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.

These are the proceedings of the 19th international conference on domain decomposition methods in science and engineering. Domain decomposition methods are iterative methods for solving the often very large linear or nonlinear systems of algebraic equations that arise in various problems in mathematics, computational science, engineering and industry. They are designed for massively parallel computers and take the memory hierarchy of such systems into account. This is essential for approaching peak floating point performance. There is an increasingly well-developed theory which is having a direct impact on the development and improvement of these algorithms.

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.

Domain decomposition is an active, interdisciplinary research area that is devoted to the development, analysis and implementation of coupling and decoupling strategies in mathematics, computational science, engineering and industry. A series of international conferences starting in 1987 set the stage for the presentation of many meanwhile classical results on substructuring, block iterative methods, parallel and distributed high performance computing etc. This volume contains a selection from the papers presented at the 15th International Domain Decomposition Conference held in Berlin, Germany, July 17-25, 2003 by the world's leading experts in the field. Its special focus has been on numerical analysis, computational issues, complex heterogeneous problems, industrial problems, and software development.