These are the proceedings of the 22nd International Conference on Domain Decomposition Methods, which was held in Lugano, Switzerland. With 172 participants from over 24 countries, this conference continued a long-standing tradition of internationally oriented meetings on Domain Decomposition Methods. The book features a well-balanced mix of established and new topics, such as the manifold theory of Schwarz Methods, Isogeometric Analysis, Discontinuous Galerkin Methods, exploitation of modern HPC architectures and industrial applications. As the conference program reflects, the growing capabilities in terms of theory and available hardware allow increasingly complex non-linear and multi-physics simulations, confirming the tremendous potential and flexibility of the domain decomposition concept.

This book is a collection of papers presented at the 23rd International Conference on Domain Decomposition Methods in Science and Engineering, held on Jeju Island, Korea on July 6-10, 2015. Domain decomposition methods solve boundary value problems by splitting them into smaller boundary value problems on subdomains and iterating to coordinate the solution between adjacent subdomains. Domain decomposition methods have considerable potential for a parallelization of the finite element methods, and serve a basis for distributed, parallel computations.

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.

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.

This book offers a comprehensive presentation of some of the most successful and popular domain decomposition preconditioners for finite and spectral element approximations of partial differential equations. It places strong emphasis on both algorithmic and mathematical aspects. It covers in detail important methods such as FETI and balancing Neumann-Neumann methods and algorithms for spectral element methods.

This two-volume book presents outcomes of the 7th International Conference on Soft Computing for Problem Solving, SocProS 2017. This conference is a joint technical collaboration between the Soft Computing Research Society, Liverpool Hope University (UK), the Indian Institute of Technology Roorkee, the South Asian University New Delhi and the National Institute of Technology Silchar, and brings together researchers, engineers and practitioners to discuss thought-provoking developments and challenges in order to select potential future directions The book presents the latest advances and innovations in the interdisciplinary areas of soft computing, including original research papers in the areas including, but not limited to, algorithms (artificial immune systems, artificial neural networks, genetic algorithms, genetic programming, and particle swarm optimization) and applications (control systems, data mining and clustering, finance, weather forecasting, game theory, business and forecasting applications). It is a valuable resource for both young and experienced researchers dealing with complex and intricate real-world problems for which finding a solution by traditional methods is a difficult task.

In this volume, designed for computational scientists and engineers working on applications requiring the memories and processing rates of large-scale parallelism, leading algorithmicists survey their own field-defining contributions, together with enough historical and bibliographical perspective to permit working one's way to the frontiers. This book is distinguished from earlier surveys in parallel numerical algorithms by its extension of coverage beyond core linear algebraic methods into tools more directly associated with partial differential and integral equations - though still with an appealing generality - and by its focus on practical medium-granularity parallelism, approachable through traditional programming languages. Several of the authors used their invitation to participate as a chance to stand back and create a unified overview, which nonspecialists will appreciate.

Domain decomposition methods provide powerful and flexible tools for the numerical approximation of partial differential equations arising in the modeling of many interesting applications in science and engineering. This book deals with discretization techniques on non-matching triangulations and iterative solvers with particular emphasis on mortar finite elements, Schwarz methods and multigrid techniques. New results on non-standard situations as mortar methods based on dual basis functions and vector field discretizations are analyzed and illustrated by numerical results. The role of trace theorems, harmonic extensions, dual norms and weak interface conditions is emphasized. Although the original idea was used successfully more than a hundred years ago, these methods are relatively new for the numerical approximation. The possibilites of high performance computations and the interest in large- scale problems have led to an increased research activity.

Predicting the future is a difficult task but, as with the weather, it is possible with good models. But how does one predict the far future before the near future is known? Time parallel time integration, also known as PinT (Parallel-in-Time) methods, aims to predict the near and far future simultaneously. In this self-contained book, the first on the topic, readers will find a comprehensive and up-to-date description of methods and techniques that have been developed to do just this. The authors describe the four main classes of PinT methods: shooting-type methods, waveform relaxation methods, time parallel multigrid methods, and direct time parallel methods. In addition, they provide historical background for each of the method classes, complete convergence analyses for the most representative variants of the methods in each class, and illustrations and runnable MATLAB code. An ideal introduction to this exciting and very active research field, Time Parallel Time Integration can be used for independent study or for a graduate course.

A textbook covering data-science and machine learning methods for modelling and control in engineering and science, with Python and MATLAB®.