This volume includes contributions from the 9th Parallel-in-Time (PinT) workshop, an annual gathering devoted to the field of time-parallel methods, aiming to adapt existing computer models to next-generation machines by adding a new dimension of scalability. As the latest supercomputers advance in microprocessing ability, they require new mathematical algorithms in order to fully realize their potential for complex systems. The use of parallel-in-time methods will provide dramatically faster simulations in many important areas, including biomedical (e.g., heart modeling), computational fluid dynamics (e.g., aerodynamics and weather prediction), and machine learning applications. Computational and applied mathematics is crucial to this progress, as it requires advanced methodologies from the theory of partial differential equations in a functional analytic setting, numerical discretization and integration, convergence analyses of iterative methods, and the development and implementation of new parallel algorithms. Therefore, the workshop seeks to bring together an interdisciplinary group of experts across these fields to disseminate cutting-edge research and facilitate discussions on parallel time integration methods.

Learn the design and analysis of numerical algorithms for aerodynamics. Ideal for graduates, researchers, and professionals in the field.

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.

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 highly acclaimed work, first published by Prentice Hall in 1989, is a comprehensive and theoretically sound treatment of parallel and distributed numerical methods. It focuses on algorithms that are naturally suited for massive parallelization, and it explores the fundamental convergence, rate of convergence, communication, and synchronization issues associated with such algorithms. This is an extensive book, which aside from its focus on parallel and distributed algorithms, contains a wealth of material on a broad variety of computation and optimization topics. It is an excellent supplement to several of our other books, including Convex Optimization Algorithms (Athena Scientific, 2015), Nonlinear Programming (Athena Scientific, 1999), Dynamic Programming and Optimal Control (Athena Scientific, 2012), Neuro-Dynamic Programming (Athena Scientific, 1996), and Network Optimization (Athena Scientific, 1998). The on-line edition of the book contains a 95-page solutions manual.

Numerical algorithms, modern programming techniques, and parallel computing are often taught serially across different courses and different textbooks. The need to integrate concepts and tools usually comes only in employment or in research - after the courses are concluded - forcing the student to synthesise what is perceived to be three independent subfields into one. This book provides a seamless approach to stimulate the student simultaneously through the eyes of multiple disciplines, leading to enhanced understanding of scientific computing as a whole. The book includes both basic as well as advanced topics and places equal emphasis on the discretization of partial differential equations and on solvers. Some of the advanced topics include wavelets, high-order methods, non-symmetric systems, and parallelization of sparse systems. The material covered is suited to students from engineering, computer science, physics and mathematics.

The book provides a practical guide to computational scientists and engineers to help advance their research by exploiting the superpower of supercomputers with many processors and complex networks. This book focuses on the design and analysis of basic parallel algorithms, the key components for composing larger packages for a wide range of applications.

Mathematics of Computing -- General.

This book deals with numerical methods that preserve properties of Hamiltonian systems, reversible systems, differential equations on manifolds and problems with highly oscillatory solutions. A complete self-contained theory of symplectic and symmetric methods, which include Runge-Kutta, composition, splitting, multistep and various specially designed integrators, is presented and their construction and practical merits are discussed. The long-time behaviour of the numerical solutions is studied using a backward error analysis (modified equations) combined with KAM theory. The book is illustrated by numerous figures, treats applications from physics and astronomy, and contains many numerical experiments and comparisons of different approaches.

This book introduces finite difference methods for both ordinary differential equations (ODEs) and partial differential equations (PDEs) and discusses the similarities and differences between algorithm design and stability analysis for different types of equations. A unified view of stability theory for ODEs and PDEs is presented, and the interplay between ODE and PDE analysis is stressed. The text emphasizes standard classical methods, but several newer approaches also are introduced and are described in the context of simple motivating examples.