Domain decomposition methods in science and engineering XIX
Author(s)
Bibliographic Information
Domain decomposition methods in science and engineering XIX
(Lecture notes in computational science and engineering, 78)
Springer, c2011
Available at 2 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references and index
"19th International Conference on Domain Decomposition, DD19, hosted by the School of Mathematics and Computational Science of the Xiangtan University and the Human Key Laboratory for Computation and Simulation in Science and Engineering and held in Zhanjiajie, China, August 17-22, 2009"--Pref
Description and Table of Contents
Description
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.
by "Nielsen BookData"