Addressing students and researchers as well as Computational Fluid Dynamics practitioners, this book is the most comprehensive review of high-resolution schemes based on the principle of Flux-Corrected Transport (FCT). The foreword by J.P. Boris and historical note by D.L. Book describe the development of the classical FCT methodology for convection-dominated transport problems, while the design philosophy behind modern FCT schemes is explained by S.T. Zalesak. The subsequent chapters present various improvements and generalizations proposed over the past three decades.
In this new edition, recent results are integrated into existing chapters in order to describe significant advances since the publication of the first edition. Also, 3 new chapters were added in order to cover the following topics: algebraic flux correction for finite elements, iterative and linearized FCT schemes, TVD-like flux limiters, acceleration of explicit and implicit solvers, mesh adaptation, failsafe limiting for systems of conservation laws, flux-corrected interpolation (remapping), positivity preservation in RANS turbulence models, and the use of FCT as an implicit subgrid scale model for large eddy simulations.

Since most of the problems arising in science and engineering are nonlinear, they are inherently difficult to solve. Traditional analytical approximations are valid only for weakly nonlinear problems and often fail when used for problems with strong nonlinearity. Nonlinear Flow Phenomena and Homotopy Analysis: Fluid Flow and Heat Transfer presents the current theoretical developments of the analytical method of homotopy analysis. This book not only addresses the theoretical framework for the method, but also gives a number of examples of nonlinear problems that have been solved by means of the homotopy analysis method. The particular focus lies on fluid flow problems governed by nonlinear differential equations. This book is intended for researchers in applied mathematics, physics, mechanics and engineering.

Both Kuppalapalle Vajravelu and Robert A. Van Gorder work at the University of Central Florida, USA."

Ricci Flow for Shape Analysis and Surface Registration introduces the beautiful and profound Ricci flow theory in a discrete setting. By using basic tools in linear algebra and multivariate calculus, readers can deduce all the major theorems in surface Ricci flow by themselves. The authors adapt the Ricci flow theory to practical computational algorithms, apply Ricci flow for shape analysis and surface registration, and demonstrate the power of Ricci flow in many applications in medical imaging, computer graphics, computer vision and wireless sensor network. Due to minimal pre-requisites, this book is accessible to engineers and medical experts, including educators, researchers, students and industry engineers who have an interest in solving real problems related to shape analysis and surface registration.

Edmund Hlawka is a leading number theorist whose work has had a lasting influence on modern number theory and other branches of mathematics. He has contributed to diophantine approximation, the geometry of numbers, uniform distributions, analytic number theory, discrete geometry, convexity, numerical integration, inequalities, differential equations and gas dynamics. Of particular importance are his findings in the geometry of numbers (especially the Minkowski-Hlawka theorem) and uniform distribution. This Selecta volume collects his most important articles, many of which were previously hard to find. It will provide a useful tool for researchers and graduate students working in the areas covered, and includes a general introduction by E. Hlawka.

The study of the genetic basis for evolution has flourished in this century, as well as our understanding of the evolvability and programmability of biological systems. Genetic algorithms meanwhile grew out of the realization that a computer program could use the biologically-inspired processes of mutation, recombination, and selection to solve hard optimization problems. Genetic and evolutionary programming provide further approaches to a wide variety of computational problems. A synthesis of these experiences reveals fundamental insights into both the computational nature of biological evolution and processes of importance to computer science. Topics include biological models of nucleic acid information processing and genome evolution; molecules, cells, and metabolic circuits that compute logical relationships; the origin and evolution of the genetic code; and the interface with genetic algorithms and genetic and evolutionary programming.

This book presents numerical and other approximation techniques for solving various types of mathematical problems that cannot be solved analytically. In addition to well known methods, it contains some non-standard approximation techniques that are now formally collected as well as original methods developed by the author that do not appear in the literature. This book contains an extensive treatment of approximate solutions to various types of integral equations, a topic that is not often discussed in detail. There are detailed analyses of ordinary and partial differential equations and descriptions of methods for estimating the values of integrals that are presented in a level of detail that will suggest techniques that will be useful for developing methods for approximating solutions to problems outside of this text. The book is intended for researchers who must approximate solutions to problems that cannot be solved analytically. It is also appropriate for students taking courses in numerical approximation techniques.

The theory of Vector Optimization is developed by a systematic usage of infimum and supremum. In order to get existence and appropriate properties of the infimum, the image space of the vector optimization problem is embedded into a larger space, which is a subset of the power set, in fact, the space of self-infimal sets. Based on this idea we establish solution concepts, existence and duality results and algorithms for the linear case. The main advantage of this approach is the high degree of analogy to corresponding results of Scalar Optimization. The concepts and results are used to explain and to improve practically relevant algorithms for linear vector optimization problems.

'Et moi, ..., si j'avait su comment en reveru.r, One service mathematics has rendered the je n'y scrais point aIle.' human race. It has put common sense back Jules Verne where it belongs, on the topmost shelf next to the dusty canister labelled 'discarded non The series is divergent; therefore we may be sense'. Eric T. Bell 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 non linearities abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sciences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One service topology has rendered mathematical physics .. .'; 'One service logic has rendered com puter science .. .'; 'One service category theory has rendered mathematics .. .'. All arguably true. And all statements obtainable this way form part of the raison d'etre of this series."

The purpose of the volume is to bring forward recent trends of research in hypercomplex analysis. The list of contributors includes first rate mathematicians and young researchers working on several different aspects in quaternionic and Clifford analysis. Besides original research papers, there are papers providing the state-of-the-art of a specific topic, sometimes containing interdisciplinary fields. The intended audience includes researchers, PhD students, postgraduate students who are interested in the field and in possible connection between hypercomplex analysis and other disciplines, including mathematical analysis, mathematical physics, algebra.

Topics in Matroid Theory provides a brief introduction to matroid theory with an emphasis on algorithmic consequences.Matroid theory is at the heart of combinatorial optimization and has attracted various pioneers such as Edmonds, Tutte, Cunningham and Lawler among others. Matroid theory encompasses matrices, graphs and other combinatorial entities under a common, solid algebraicframework, thereby providing the analytical tools to solve related difficult algorithmic problems. The monograph contains a rigorousaxiomatic definition of matroids along with other necessary concepts such as duality, minors, connectivity and representability asdemonstrated in matrices, graphs and transversals. The author also presents a deep decomposition result in matroid theory that providesa structural characterization of graphic matroids, and show how this can be extended to signed-graphic matroids, as well as the immediatealgorithmic consequences.

"

This book constitutes thoroughly revised selected papers of the 5th International Conference on Numerical Analysis and ItsApplications, NAA 2012, held in Lozenetz, Bulgaria, in June 2012. The 65 revised papers presented were carefully reviewed and selected from various submissions. The papers cover a broad area of topics of interest such as numerical approximation and computational geometry; numerical linear algebra and numerical solution of transcendental equation; numerical methods for differential equations; numerical stochastics, numerical modeling; and high performance scientific computing."

This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, in February 2013. The 29 full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on computational geometry, approximation and randomized algorithms, parallel and distributed computing, graph algorithms, complexity and bounds, and graph drawing.

Approximation theory and numerical analysis are central to the creation of accurate computer simulations and mathematical models. Research in these areas can influence the computational techniques used in a variety of mathematical and computational sciences.

This collection of contributed chapters, dedicated to renowned mathematician Gradimir V. Milovanovi, represent the recent work of experts in the fields of approximation theory and numerical analysis. These invited contributions describe new trends in these important areas of research including theoretic developments, new computational algorithms, and multidisciplinary applications.

Special features of this volume:

- Presents results and approximation methods in various computational settings including: polynomial and orthogonal systems, analytic functions, and differential equations.

- Provides a historical overview of approximation theory and many of its subdisciplines;

- Contains new results from diverse areas of research spanning mathematics, engineering, and the computational sciences.

"Approximation and Computation" is intended for mathematicians and researchers focusing on approximation theory and numerical analysis, but can also be a valuable resource to students and researchers in the computational and applied sciences."

This book deals with the numerical analysis and efficient numerical treatment of high-dimensional integrals using sparse grids and other dimension-wise integration techniques with applications to finance and insurance. The book focuses on providing insights into the interplay between coordinate transformations, effective dimensions and the convergence behaviour of sparse grid methods. The techniques, derivations and algorithms are illustrated by many examples, figures and code segments. Numerical experiments with applications from finance and insurance show that the approaches presented in this book can be faster and more accurate than (quasi-) Monte Carlo methods, even for integrands with hundreds of dimensions.

Readers of this book will learn how to solve a wide range of optimal investment problems arising in finance and economics.
Starting from the fundamental Merton problem, many variants are presented and solved, often using numerical techniques
that the book also covers. The final chapter assesses the relevance of many of the models in common use when applied to data.

The book contains a selection of high quality papers, chosen among the best presentations during the International Conference on Spectral and High-Order Methods (2009), and provides an overview of the depth and breadth of the activities within this important research area. The carefully reviewed selection of the papers will provide the reader with a snapshot of state-of-the-art and help initiate new research directions through the extensive bibliography.

In recent years there has been an increasing interest in problems involving closed form evaluations of (and representations of the Riemann Zeta function at positive integer arguments as) various families of series associated with the Riemann Zeta function ((s), the Hurwitz Zeta function ((s, a), and their such extensions and generalizations as (for example) Lerch's transcendent (or the Hurwitz-Lerch Zeta function) iI>(z, s, a). Some of these developments have apparently stemmed from an over two-century-old theorem of Christian Goldbach (1690-1764), which was stated in a letter dated 1729 from Goldbach to Daniel Bernoulli (1700-1782), from recent rediscoveries of a fairly rapidly convergent series representation for ((3), which is actually contained in a 1772 paper by Leonhard Euler (1707-1783), and from another known series representation for ((3), which was used by Roger Apery (1916-1994) in 1978 in his celebrated proof of the irrationality of ((3). This book is motivated essentially by the fact that the theories and applications of the various methods and techniques used in dealing with many different families of series associated with the Riemann Zeta function and its aforementioned relatives are to be found so far only"in widely scattered journal articles. Thus our systematic (and unified) presentation of these results on the evaluation and representation of the Zeta and related functions is expected to fill a conspicuous gap in the existing books dealing exclusively with these Zeta functions."

Arguably, many industrial optimization problems are of the multiobjective type. The present work, after providing a survey of the state of the art in multiobjective optimization, gives new insight into this important mathematical field by consequently taking up the viewpoint of differential geometry. This approach, unprecedented in the literature, very naturally results in a generalized homotopy method for multiobjective optimization which is theoretically well-founded and numerically efficient. The power of the new method is demonstrated by solving two real-life problems of industrial optimization.
The book presents recent results obtained by the author and is aimed at mathematicians, scientists, students and practitioners interested in optimization and numerical homotopy methods.

Discrete Event Systems: Diagnosis and Diagnosability addresses the problem of fault diagnosis of Discrete Event Systems (DESs). This book provides the basic techniques and approaches necessary for the design of an efficient fault diagnosis system for a wide range of modern engineering applications. This book classifies the different techniques and approaches according to several criteria such as: modeling tools (Automata, Petri nets, Templates) that is used to construct the model; the information (qualitative based on events occurrences and/or states outputs, quantitative based on signal processing, data analysis) that is needed to analyze and achieve the diagnosis; the decision structure (centralized, decentralized) that is required to achieve the diagnosis; as well as the complexity (polynomial, exponential) of the algorithm that is used to determine the set of faults that the proposed approach is able to diagnose as well as the delay time required for this diagnosis. The goal of this classification is to select the efficient method to achieve the fault diagnosis according to the application constraints. This book will include illustrated examples of the presented methods and techniques as well as a discussion on the application of these methods on several real-world problems.

This book illustrates how models of complex systems are built up and provides indispensable mathematical tools for studying their dynamics. This second edition includes more recent research results and many new and improved worked out examples and exercises.

This volume contains the Proceedings of the International Workshop Variational Methods For Discontinuous Structures, which was jointly organized by the Dipar timento di Matematica Francesco Brioschi of Milano Politecnico and the Interna tional School for Advanced Studies (SISSA) of Trieste. The Conference took place at Villa Erba Antica (Cernobbio) on the Lago di Como on July 4- 6, 2001. In past years the calculus of variations faced mainly the study of continuous structures, say particularly problems with smooth solutions. One of the deepest and more delicate problems was the regularity of weak solutions. More recently, new sophisticated tools have been introduced in order to study discontinuities: in many variational problems solutions develop singularities, and sometimes the most interesting part of a solution is the singularity itself. The conference intended to focus on recent developments in this direction. Some of the talks were devoted to differential or variational modelling of image segmentation, occlusion and textures synthesizing in image analysis, varia tional description of micro-magnetic materials, dimension reduction and structured deformations in elasticity and plasticity, phase transitions, irrigation and drainage, evolution of crystalline shapes; in most cases theoretical and numerical analysis of these models were provided. viii Preface Other talks were dedicated to specific problems of the calculus of variations: variational theory of weak or lower-dimensional structures, optimal transport prob lems with free Dirichlet regions, higher order variational problems, symmetrization in the BV framework."

Mathematics is playing an ever more important role in the physical and biological sciences, provoking a blurring of boundaries between scientific dis ciplines and a resurgence of interest in the modern as well as the classical techniques of applied mathematics. This renewal of interest, both in research and teaching, has led to the establishment of the series: Texts in Applied Mathe matics (TAM). The development of new courses is a natural consequence of a high level of excitement on the research frontier as newer techniques, such as numerical and symbolic computer systems, dynamical systems, and chaos, mix with and reinforce the traditional methods of applied mathematics. Thus, the purpose of this textbook series is to meet the current and future needs of these advances and encourage the teaching of new courses. TAM will publish textbooks suitable for use in advanced undergraduate and beginning graduate courses, and will complement the Applied Mathematical Sciences (AMS) series, which will focus on advanced textbooks and research level monographs. Preface A successful concurrent numerical simulation requires physics and math ematics to develop and analyze the model, numerical analysis to develop solution methods, and computer science to develop a concurrent implemen tation. No single course can or should cover all these disciplines. Instead, this course on concurrent scientific computing focuses on a topic that is not covered or is insufficiently covered by other disciplines: the algorith mic structure of numerical methods.

This book gives a systematic account of the facts concerning complexes of differential operators on differentiable manifolds. The central place is occupied by the study of general complexes of differential operators between sections of vector bundles. Although the global situation often contains nothing new as compared with the local one (that is, complexes of partial differential operators on an open subset of ]Rn), the invariant language allows one to simplify the notation and to distinguish better the algebraic nature of some questions. In the last 2 decades within the general theory of complexes of differential operators, the following directions were delineated: 1) the formal theory; 2) the existence theory; 3) the problem of global solvability; 4) overdetermined boundary problems; 5) the generalized Lefschetz theory of fixed points, and 6) the qualitative theory of solutions of overdetermined systems. All of these problems are reflected in this book to some degree. It is superfluous to say that different directions sometimes whimsically intersect. Considerable attention is given to connections and parallels with the theory of functions of several complex variables. One of the reproaches avowed beforehand by the author consists of the shortage of examples. The framework of the book has not permitted their number to be increased significantly. Certain parts of the book consist of results obtained by the author in 1977-1986. They have been presented in seminars in Krasnoyarsk, Moscow, Ekaterinburg, and N ovosi birsk.

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

This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of Computer Science at the University of Edin burgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The underlying theme of the monograph is the study of two classical problems: counting the elements of a finite set of combinatorial structures, and generating them uniformly at random. In their exact form, these prob lems appear to be intractable for many important structures, so interest has focused on finding efficient randomised algorithms that solve them ap proxim~ly, with a small probability of error. For most natural structures the two problems are intimately connected at this level of approximation, so it is natural to study them together. At the heart of the monograph is a single algorithmic paradigm: sim ulate a Markov chain whose states are combinatorial structures and which converges to a known probability distribution over them. This technique has applications not only in combinatorial counting and generation, but also in several other areas such as statistical physics and combinatorial optimi sation. The efficiency of the technique in any application depends crucially on the rate of convergence of the Markov chain.