This book, dedicated to the memory of Gian-Carlo Rota, is the result of a collaborative effort by his friends, students and admirers. Rota was one of the great thinkers of our times, innovator in both mathematics and phenomenology. I feel moved, yet touched by a sense of sadness, in presenting this volume of work, despite the fear that I may be unworthy of the task that befalls me. Rota, both the scientist and the man, was marked by a generosity that knew no bounds. His ideas opened wide the horizons of fields of research, permitting an astonishing number of students from all over the globe to become enthusiastically involved. The contagious energy with which he demonstrated his tremendous mental capacity always proved fresh and inspiring. Beyond his renown as gifted scientist, what was particularly striking in Gian-Carlo Rota was his ability to appreciate the diverse intellectual capacities of those before him and to adapt his communications accordingly. This human sense, complemented by his acute appreciation of the importance of the individual, acted as a catalyst in bringing forth the very best in each one of his students. Whosoever was fortunate enough to enjoy Gian-Carlo Rota's longstanding friendship was most enriched by the experience, both mathematically and philosophically, and had occasion to appreciate son cote de bon vivant. The book opens with a heartfelt piece by Henry Crapo in which he meticulously pieces together what Gian-Carlo Rota's untimely demise has bequeathed to science.

One of the current main challenges in the area of scientific computing is the design and implementation of accurate numerical models for complex physical systems which are described by time dependent coupled systems of nonlinear PDEs. This volume integrates the works of experts in computational mathematics and its applications, with a focus on modern algorithms which are at the heart of accurate modeling: adaptive finite element methods, conservative finite difference methods and finite volume methods, and multilevel solution techniques. Fundamental theoretical results are revisited in survey articles and new techniques in numerical analysis are introduced. Applications showcasing the efficiency, reliability and robustness of the algorithms in porous media, structural mechanics and electromagnetism are presented. Researchers and graduate students in numerical analysis and numerical solutions of PDEs and their scientific computing applications will find this book useful.

Over the past decades, the Boundary Element Method has emerged as a ver satile and powerful tool for the solution of engineering problems, presenting in many cases an alternative to the more widely used Finite Element Method. As with any numerical method, the engineer or scientist who applies it to a practical problem needs to be acquainted with, and understand, its basic principles to be able to apply it correctly and be aware of its limitations. It is with this intention that we have endeavoured to write this book: to give the student or practitioner an easy-to-understand introductory course to the method so as to enable him or her to apply it judiciously. As the title suggests, this book not only serves as an introductory course, but also cov ers some advanced topics that we consider important for the researcher who needs to be up-to-date with new developments. This book is the result of our teaching experiences with the Boundary Element Method, along with research and consulting activities carried out in the field. Its roots lie in a graduate course on the Boundary Element Method given by the authors at the university of Stuttgart. The experiences gained from teaching and the remarks and questions of the students have contributed to shaping the 'Introductory course' (Chapters 1-8) to the needs of the stu dents without assuming a background in numerical methods in general or the Boundary Element Method in particular."

The theory of constructive (recursive) models follows from works of Froehlich, Shepherdson, Mal'tsev, Kuznetsov, Rabin, and Vaught in the 50s. Within the framework of this theory, algorithmic properties of abstract models are investigated by constructing representations on the set of natural numbers and studying relations between algorithmic and structural properties of these models. This book is a very readable exposition of the modern theory of constructive models and describes methods and approaches developed by representatives of the Siberian school of algebra and logic and some other researchers (in particular, Nerode and his colleagues). The main themes are the existence of recursive models and applications to fields, algebras, and ordered sets (Ershov), the existence of decidable prime models (Goncharov, Harrington), the existence of decidable saturated models (Morley), the existence of decidable homogeneous models (Goncharov and Peretyat'kin), properties of the Ehrenfeucht theories (Millar, Ash, and Reed), the theory of algorithmic dimension and conditions of autostability (Goncharov, Ash, Shore, Khusainov, Ventsov, and others), and the theory of computable classes of models with various properties. Future perspectives of the theory of constructive models are also discussed. Most of the results in the book are presented in monograph form for the first time. The theory of constructive models serves as a basis for recursive mathematics. It is also useful in computer science, in particular, in the study of programming languages, higher level languages of specification, abstract data types, and problems of synthesis and verification of programs. Therefore, the book will be useful for not only specialists in mathematical logic and the theory of algorithms but also for scientists interested in the mathematical fundamentals of computer science. The authors are eminent specialists in mathematical logic. They have established fundamental results on elementary theories, model theory, the theory of algorithms, field theory, group theory, applied logic, computable numberings, the theory of constructive models, and the theoretical computer science.

The first edition of this book entitled Analysis on Riemannian Manifolds and Some Problems of Mathematical Physics was published by Voronezh Univer sity Press in 1989. For its English edition, the book has been substantially revised and expanded. In particular, new material has been added to Sections 19 and 20. I am grateful to Viktor L. Ginzburg for his hard work on the transla tion and for writing Appendix F, and to Tomasz Zastawniak for his numerous suggestions. My special thanks go to the referee for his valuable remarks on the theory of stochastic processes. Finally, I would like to acknowledge the support of the AMS fSU Aid Fund and the International Science Foundation (Grant NZBOOO), which made possible my work on some of the new results included in the English edition of the book. Voronezh, Russia Yuri Gliklikh September, 1995 Preface to the Russian Edition The present book is apparently the first in monographic literature in which a common treatment is given to three areas of global analysis previously consid ered quite distant from each other, namely, differential geometry and classical mechanics, stochastic differential geometry and statistical and quantum me chanics, and infinite-dimensional differential geometry of groups of diffeomor phisms and hydrodynamics. The unification of these topics under the cover of one book appears, however, quite natural, since the exposition is based on a geometrically invariant form of the Newton equation and its analogs taken as a fundamental law of motion."

'Et moi, .. " si j'avait su comment en revenir, je One service mathematics bas rendered the human race. It bas put common sense back n'y serais point aile.' where it belongs, on the topmost shelf next to Jules Verne the dusty canister labelled 'discarded nonsense' . Eric T. Bell The series is divergent; therefore we may be able to do something with it O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlineari ties abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sci ences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One ser vice topology has rendered mathematical physics .. .'; 'One service logic has rendered computer science .. .'; 'One service category theory has rendered mathematics .. .'. All arguably true. And all statements obtainable this way form part of the raison d'ctre of this series."

Multiprocessing: Trade-Offs in Computation and Communication presents an in-depth analysis of several commonly observed regular and irregular computations for multiprocessor systems. This book includes techniques which enable researchers and application developers to quantitatively determine the effects of algorithm data dependencies on execution time, on communication requirements, on processor utilization and on the speedups possible. Starting with simple, two-dimensional, diamond-shaped directed acyclic graphs, the analysis is extended to more complex and higher dimensional directed acyclic graphs. The analysis allows for the quantification of the computation and communication costs and their interdependencies. The practical significance of these results on the performance of various data distribution schemes is clearly explained. Using these results, the performance of the parallel computations are formulated in an architecture independent fashion. These formulations allow for the parameterization of the architecture specitific entities such as the computation and communication rates. This type of parameterized performance analysis can be used at compile time or at run-time so as to achieve the most optimal distribution of the computations. The material in Multiprocessing: Trade-Offs in Computation and Communication connects theory with practice, so that the inherent performance limitations in many computations can be understood, and practical methods can be devised that would assist in the development of software for scalable high performance systems.

This book is a revised edition of the monograph which appeared under the same title in the series Research Notes in Theoretical Computer Science, Pit man, in 1986. In addition to a general effort to improve typography, English, and presentation, the main novelty of this second edition is the integration of some new material. Part of it is mine (mostly jointly with coauthors). Here is brief guide to these additions. I have augmented the account of categorical combinatory logic with a description of the confluence properties of rewriting systems of categor ical combinators (Hardin, Yokouchi), and of the newly developed cal culi of explicit substitutions (Abadi, Cardelli, Curien, Hardin, Levy, and Rios), which are similar in spirit to the categorical combinatory logic, but are closer to the syntax of A-calculus (Section 1.2). The study of the full abstraction problem for PCF and extensions of it has been enriched with a new full abstraction result: the model of sequential algorithms is fully abstract with respect to an extension of PCF with a control operator (Cartwright, Felleisen, Curien). An order extensional model of error-sensitive sequential algorithms is also fully abstract for a corresponding extension of PCF with a control operator and errors (Sections 2.6 and 4.1). I suggest that sequential algorithms lend themselves to a decomposition of the function spaces that leads to models of linear logic (Lamarche, Curien), and that connects sequentiality with games (Joyal, Blass, Abramsky) (Sections 2.1 and 2.6)."

Our Subjects and Objectives. This book is about algebraic and symbolic computation and numerical computing (with matrices and polynomials). It greatly extends the study of these topics presented in the celebrated books of the seventies, [AHU] and [BM] (these topics have been under-represented in [CLR], which is a highly successful extension and updating of [AHU] otherwise). Compared to [AHU] and [BM] our volume adds extensive material on parallel com putations with general matrices and polynomials, on the bit-complexity of arithmetic computations (including some recent techniques of data compres sion and the study of numerical approximation properties of polynomial and matrix algorithms), and on computations with Toeplitz matrices and other dense structured matrices. The latter subject should attract people working in numerous areas of application (in particular, coding, signal processing, control, algebraic computing and partial differential equations). The au thors' teaching experience at the Graduate Center of the City University of New York and at the University of Pisa suggests that the book may serve as a text for advanced graduate students in mathematics and computer science who have some knowledge of algorithm design and wish to enter the exciting area of algebraic and numerical computing. The potential readership may also include algorithm and software designers and researchers specializing in the design and analysis of algorithms, computational complexity, alge braic and symbolic computing, and numerical computation.

The present monograph defines, interprets and uses the matrix of partial derivatives of the state vector with applications for the study of some common categories of engineering. The book covers broad categories of processes that are formed by systems of partial derivative equations (PDEs), including systems of ordinary differential equations (ODEs). The work includes numerous applications specific to Systems Theory based on Mpdx, such as parallel, serial as well as feed-back connections for the processes defined by PDEs. For similar, more complex processes based on Mpdx with PDEs and ODEs as components, we have developed control schemes with PID effects for the propagation phenomena, in continuous media (spaces) or discontinuous ones (chemistry, power system, thermo-energetic) or in electro-mechanics (railway - traction) and so on. The monograph has a purely engineering focus and is intended for a target audience working in extremely diverse fields of application (propagation phenomena, diffusion, hydrodynamics, electromechanics) in which the use of PDEs and ODEs is justified.

This book presents the notes from the seminar on wave phenomena given in 2019 at the Mathematical Research Center in Oberwolfach. The research on wave-type problems is a fascinating and emerging field in mathematical research with many challenging applications in sciences and engineering. Profound investigations on waves require a strong interaction of several mathematical disciplines including functional analysis, partial differential equations, mathematical modeling, mathematical physics, numerical analysis, and scientific computing. The goal of this book is to present a comprehensive introduction to the research on wave phenomena. Starting with basic models for acoustic, elastic, and electro-magnetic waves, topics such as the existence of solutions for linear and some nonlinear material laws, efficient discretizations and solution methods in space and time, and the application to inverse parameter identification problems are covered. The aim of this book is to intertwine analysis and numerical mathematics for wave-type problems promoting thus cooperative research projects in this field.

Traditional Artificial Intelligence (AI) systems adopted symbolic processing as their main paradigm. Symbolic AI systems have proved effective in handling problems characterized by exact and complete knowledge representation. Unfortunately, these systems have very little power in dealing with imprecise, uncertain and incomplete data and information which significantly contribute to the description of many real world problems, both physical systems and processes as well as mechanisms of decision making. Moreover, there are many situations where the expert domain knowledge (the basis for many symbolic AI systems) is not sufficient for the design of intelligent systems, due to incompleteness of the existing knowledge, problems caused by different biases of human experts, difficulties in forming rules, etc. In general, problem knowledge for solving a given problem can consist of an explicit knowledge (e.g., heuristic rules provided by a domain an implicit, hidden knowledge "buried" in past-experience expert) and numerical data. A study of huge amounts of these data (collected in databases) and the synthesizing of the knowledge "encoded" in them (also referred to as knowledge discovery in data or data mining), can significantly improve the performance of the intelligent systems designed."

Iterative methods for finding fixed points of non-expansive operators in Hilbert spaces have been described in many publications. In this monograph we try to present the methods in a consolidated way. We introduce several classes of operators, examine their properties, define iterative methods generated by operators from these classes and present general convergence theorems. On this basis we discuss the conditions under which particular methods converge. A large part of the results presented in this monograph can be found in various forms in the literature (although several results presented here are new). We have tried, however, to show that the convergence of a large class of iteration methods follows from general properties of some classes of operators and from some general convergence theorems.

This book focuses on the nonlinear behaviour of thin-wall shells (single- and multilayered with delamination areas) under various uniform and non-uniform loadings.
The dependence of critical (buckling) load upon load variability is revealed to be highly non-monotonous, showing minima when load variability is close to the eigenmode variabilities of solution branching points of the respective nonlinear boundary problem.
A novel numerical approach is employed to analyze branching points and to build primary, secondary, and tertiary bifurcation paths of the nonlinear boundary problem for the case of uniform loading. The load levels of singular points belonging to the paths are considered to be critical load estimates for the case of non-uniform loadings.

The ADI Model Problem presents the theoretical foundations of Alternating Direction Implicit (ADI) iteration for systems with both real and complex spectra and extends early work for real spectra into the complex plane with methods for computing optimum iteration parameters for both one and two variable problems. This book provides application of theory to the solution of boundary value problems and description of stable similarity reduction of a full matrix to low-band upper Hessenberg form, with application to computation of eigenvalues and solution of Lyapunov and Sylvester equations. Also included are MATLAB programs and numerical verification of theory and applications.

Polynomial optimization have been a hot research topic for the past few years and its applications range from Operations Research, biomedical engineering, investment science, to quantum mechanics, linear algebra, and signal processing, among many others. In this brief the authors discuss some important subclasses of polynomial optimization models arising from various applications, with a focus on approximations algorithms with guaranteed worst case performance analysis. The brief presents a clear view of the basic ideas underlying the design of such algorithms and the benefits are highlighted by illustrative examples showing the possible applications.

This timely treatise will appeal to researchers and graduate students in the fields of optimization, computational mathematics, Operations Research, industrial engineering, and computer science."

Kronecker products are used to define the underlying Markov chain (MC) in various modeling formalisms, including compositional Markovian models, hierarchical Markovian models, and stochastic process algebras. The motivation behind using a Kronecker structured representation rather than a flat one is to alleviate the storage requirements associated with the MC. With this approach, systems that are an order of magnitude larger can be analyzed on the same platform. The developments in the solution of such MCs are reviewed from an algebraic point of view and possible areas for further research are indicated with an emphasis on preprocessing using reordering, grouping, and lumping and numerical analysis using block iterative, preconditioned projection, multilevel, decompositional, and matrix analytic methods. Case studies from closed queueing networks and stochastic chemical kinetics are provided to motivate decompositional and matrix analytic methods, respectively.

This volume contains eighteen contributions of work, conducted since 2000 in the French - German Research Programme "Numerical Flow Simulation," which was initiated in 1996 by the Centre National de la Recherche Scientifique (CNRS) and the Deutsche Forschungsgemeinschaft (DFG). The main purpose of this third publication on the research programme is again to give an overview over recent progress, and to make the obtained results available to the public. The reports are grouped, like those in the first and the second publi cation (NNFM 66, 1998, and NNFM 75, 2001), under the four headings "Devel opment of Solution Techniques," "Crystal Growth and Melts," "Flows of React ing Gases, Sound Generation" and "Turbulent Flows." All contributions to this publication were reviewed by a board consisting of T. Alziary de Roquefort (Poi tiers, France), H. W. Buggisch (Karlsruhe, Germany), S. Candel (Paris, France), U. Ehrenstein (Nice, France), Th. Gallouet (Marseille, France), W. Kordulla (Gottingen, Germany), A. Lerat (Paris, France), 1. Piquet (Nantes, France), R. Rannacher (Heidelberg, Germany), G. Warnecke (Magdeburg, Germany), and the editor. The responsibility for the contents of the reports nevertheless lies with the contributors."

A fundamental and comprehensive framework for network security designed for military, government, industry, and academic network personnel. Scientific validation of "security on demand" through computer modeling and simulation methods. The book presents an example wherein the framework is utilized to integrate security into the operation of a network. As a result of the integration, the inherent attributes of the network may be exploited to reduce the impact of security on network performance and the security availability may be increased down to the user level. The example selected is the ATM network which is gaining widespread acceptance and use.

This brief provides guidance for the application of cohesive models to determine damage and fracture in materials and structural components. This can be done for configurations with or without a pre-existing crack. Although the brief addresses structural behaviour, the methods described herein may also be applied to any deformation induced material damage and failure, e.g. those occurring during manufacturing processes. The methods described are applicable to the behaviour of ductile metallic materials and structural components made thereof. Hints are also given for applying the cohesive model to other materials.

What is the role of exercise in maintaining good health and preventing metabolic disease, hypertension, cardiorespiratory disease, cancer, and obesity? What is the optimal exercise level to prevent such common diseases and conditions? These important questions were addressed and discussed by researchers, therapists, and physicians at the international symposium "Optimal Exercise for Preventing Common Diseases," held in Fukuoka, Japan, in July 1998, in conjunction with the Fukuoka University Research Center. This book compiles the papers presented at the symposium, giving state-of-the-art information that will be especially valuable to exercise physiologists, physical therapists, and those working in the field of sports medicine.

This book deals with the mathematical properties of dimensioned quantities, such as length, mass, voltage, and viscosity.
Beginning with a careful examination of how one expresses the numerical results of a measurement and uses these results in subsequent manipulations, the author rigorously constructs the notion of dimensioned numbers and discusses their algebraic structure. The result is a unification of linear algebra and traditional dimensional analysis that can be extended from the scalars to which the traditional analysis is perforce restricted to multidimensional vectors of the sort frequently encountered in engineering, systems theory, economics, and other applications.

This book surveys recent developments in numerical techniques for global atmospheric models. It is based upon a collection of lectures prepared by leading experts in the field. The chapters reveal the multitude of steps that determine the global atmospheric model design. They encompass the choice of the equation set, computational grids on the sphere, horizontal and vertical discretizations, time integration methods, filtering and diffusion mechanisms, conservation properties, tracer transport, and considerations for designing models for massively parallel computers. A reader interested in applied numerical methods but also the many facets of atmospheric modeling should find this book of particular relevance.

In the recent decade, there has been a growing interest in the numerical treatment of high-dimensional problems. It is well known that classical numerical discretization schemes fail in more than three or four dimensions due to the curse of dimensionality. The technique of sparse grids helps overcome this problem to some extent under suitable regularity assumptions. This discretization approach is obtained from a multi-scale basis by a tensor product construction and subsequent truncation of the resulting multiresolution series expansion. This volume of LNCSE is a collection of the papers from the proceedings of the workshop on sparse grids and its applications held in Bonn in May 2011. The selected articles present recent advances in the mathematical understanding and analysis of sparse grid discretization. Aspects arising from applications are given particular attention.

The author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science. In the first part of the book he presents the new classical theory of finite automata as unary algebras which he himself invented about 30 years ago. Many results, like his work on structure lattices or his characterization of regular sets by generalized regular rules, are unknown to a wider audience. In the second part of the book he extends the theory to general (non-unary, many-sorted) algebras, term rewriting systems, tree automata, and pushdown automata. Essentially Buchi worked independent of other rersearch, following a novel and stimulating approach. He aimed for a mathematical theory of terms, but could not finish the book. Many of the results are known by now, but to work further along this line presents a challenging research program on the borderline between universal algebra, term rewriting systems, and automata theory. For the whole book and again within each chapter the author starts at an elementary level, giving careful explanations and numerous examples and exercises, and then leads up to the research level. In this way he covers the basic theory as well as many nonstandard subjects. Thus the book serves as a textbook for both the beginner and the advances student, and also as a rich source for the expert.