Main aspects of the efficient treatment of partial differential equations are discretisation, multilevel/multigrid solution and parallelisation. These distinct topics are covered from the historical background to modern developments. It is demonstrated how the ingredients can be put together to give an adaptive and parallel multilevel approach for the solution of elliptic boundary value problems. Error estimators and adaptive grid refinement techniques for ordinary and for sparse grid discretisations are presented. Different types of additive and multiplicative multilevel solvers are discussed with respect to parallel implementation and application to adaptive refined grids. Efficiency issues are treated both for the sequential multilevel methods and for the parallel version by hash table storage techniques. Finally, space-filling curve enumeration for parallel load balancing and processor cache efficiency are discussed.

A practical handbook for understanding and using fast adaptive composite grid (FAC) methods for discretization and solution of partial differential equations (PDEs). Contains fundamental concepts. These so-called FAC are characterized by their use of a composite grid, which is nominally the union of various uniform grids. FAC is capable of producing a composite grid with tailored resolution, and a corresponding solution with commensurate accuracy, at a cost proportional to the number of composite grid points. Moreover, special asynchronous versions of the fast adaptive composite grid methods (AFAC) studied here have seemingly optimal complexity in a parallel computing environment. Most of the methods treated in this book were discovered only within the last decade, and in many cases their development is still in its infancy. While this is not meant to be comprehensive, it does provide a theoretical and practical guide to multilevel adaptive methods and relevant discretization techniques.

The multilevel projection method is a new formalism that provides a framework for the development of multilevel algorithms in a very general setting. This methodology guides the choices of all the major multilevel processes, including relaxation and coarsening, and it applies directly to global or locally-refined discretizations. This book was developed from lectures at the CBMS-NSF Regional Conference on Multigrid and Multilevel Adaptive Methods for Partial Differential Equations in June 1991, and is a supplement to Multilevel Adaptive Methods for Partial Differential Equations, also written by Stephen F. McCormick.

Nowadays there is an increasing emphasis on all aspects of adaptively gener ating a grid that evolves with the solution of a PDE. Another challenge is to develop efficient higher-order one-step integration methods which can handle very stiff equations and which allow us to accommodate a spatial grid in each time step without any specific difficulties. In this monograph a combination of both error-controlled grid refinement and one-step methods of Rosenbrock-type is presented. It is my intention to impart the beauty and complexity found in the theoretical investigation of the adaptive algorithm proposed here, in its realization and in solving non-trivial complex problems. I hope that this method will find many more interesting applications. Berlin-Dahlem, May 2000 Jens Lang Acknowledgements I have looked forward to writing this section since it is a pleasure for me to thank all friends who made this work possible and provided valuable input. I would like to express my gratitude to Peter Deuflhard for giving me the oppor tunity to work in the field of Scientific Computing. I have benefited immensly from his help to get the right perspectives, and from his continuous encourage ment and support over several years. He certainly will forgive me the use of Rosenbrock methods rather than extrapolation methods to integrate in time.

the solution or its gradient. These new discretization techniques are promising approaches to overcome the severe problem of mesh-generation. Furthermore, the easy coupling of meshfree discretizations of continuous phenomena to dis crete particle models and the straightforward Lagrangian treatment of PDEs via these techniques make them very interesting from a practical as well as a theoretical point of view. Generally speaking, there are two different types of meshfree approaches; first, the classical particle methods [104, 105, 107, 108] and second, meshfree discretizations based on data fitting techniques [13, 39]. Traditional parti cle methods stem from physics applications like Boltzmann equations [3, 50] and are also of great interest in the mathematical modeling community since many applications nowadays require the use of molecular and atomistic mod els (for instance in semi-conductor design). Note however that these methods are Lagrangian methods; i. e. , they are based On a time-dependent formulation or conservation law and can be applied only within this context. In a particle method we use a discrete set of points to discretize the domain of interest and the solution at a certain time. The PDE is then transformed into equa tions of motion for the discrete particles such that the particles can be moved via these equations. After time discretization of the equations of motion we obtain a certain particle distribution for every time step.

List of participants; Elliptic equations; Parabolic equations; Hyperbolic equations.