Seems you have not registered as a member of localhost.saystem.shop!
You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
Contact Mechanics
This volume contains 44 papers presented at the Third Contact Mechanics International Symposium (CMIS 2001) held in Praia da Consola9ao, Peniche (portugal), June 17-21,2001. This Symposium was the direct continuation of the first two CMIS held in Lausanne (1992) and in Carry-Le-Rouet (1994). Other related meetings, in what concerns scientific topics and participants, took place in the nineties at La Grande Motte (1990), Vadstena (1996), Ferrara (1997), Munich (1998) and Grenoble (1999). The Symposium aimed at gathering researchers with interests in a wide range of topics in theoretical, computational and experimental contact mechanics. The call for papers mentioned topics in tribology, mathe...
Domain Decomposition Methods in Science and Engineering XXI
This volume contains a selection of papers presented at the 21st international conference on domain decomposition methods in science and engineering held in Rennes, France, June 25-29, 2012. Domain decomposition is an active and interdisciplinary research discipline, focusing on the development, analysis and implementation of numerical methods for massively parallel computers. Domain decomposition methods are among the most efficient solvers for large scale applications in science and engineering. They are based on a solid theoretical foundation and shown to be scalable for many important applications. Domain decomposition techniques can also naturally take into account multiscale phenomena. This book contains the most recent results in this important field of research, both mathematically and algorithmically and allows the reader to get an overview of this exciting branch of numerical analysis and scientific computing.
Domain Decomposition Methods in Science and Engineering XVIII
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 pri...
Domain Decomposition Methods in Science and Engineering XX
These are the proceedings of the 20th international conference on domain decomposition methods in science and engineering. Domain decomposition methods are iterative methods for solving the often very large linearor nonlinear systems of algebraic equations that arise when various problems in continuum mechanics are discretized using finite elements. They are designed for massively parallel computers and take the memory hierarchy of such systems in mind. This is essential for approaching peak floating point performance. There is an increasingly well developed theory whichis having a direct impact on the development and improvements of these algorithms.
Domain Decomposition Methods in Science and Engineering XVII
Domain decomposition is an active, interdisciplinary research field concerned with the development, analysis, and implementation of coupling and decoupling strategies in mathematical and computational models. This volume contains selected papers presented at the 17th International Conference on Domain Decomposition Methods in Science and Engineering. It presents the newest domain decomposition techniques and examines their use in the modeling and simulation of complex problems.
Parallel Computing: On the Road to Exascale
As predicted by Gordon E. Moore in 1965, the performance of computer processors increased at an exponential rate. Nevertheless, the increases in computing speeds of single processor machines were eventually curtailed by physical constraints. This led to the development of parallel computing, and whilst progress has been made in this field, the complexities of parallel algorithm design, the deficiencies of the available software development tools and the complexity of scheduling tasks over thousands and even millions of processing nodes represent a major challenge to the construction and use of more powerful parallel systems. This book presents the proceedings of the biennial International Co...
An Introduction to Domain Decomposition Methods
The purpose of this book is to offer an overview of the most popular domain decomposition methods for partial differential equations (PDEs). These methods are widely used for numerical simulations in solid mechanics, electromagnetism, flow in porous media, etc., on parallel machines from tens to hundreds of thousands of cores. The appealing feature of domain decomposition methods is that, contrary to direct methods, they are naturally parallel. The authors focus on parallel linear solvers. The authors present all popular algorithms, both at the PDE level and at the discrete level in terms of matrices, along with systematic scripts for sequential implementation in a free open-source finite element package as well as some parallel scripts. Also included is a new coarse space construction (two-level method) that adapts to highly heterogeneous problems.
Domain Decomposition Methods in Science and Engineering XIX
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.
