The problems of conditional optimization of the uniform (or C-) norm for polynomials and rational functions arise in various branches of science and technology. Their numerical solution is notoriously difficult in case of high degree functions. The book develops the classical Chebyshev's approach which gives analytical representation for the solution in terms of Riemann surfaces. The techniques born in the remote (at the first glance) branches of mathematics such as complex analysis, Riemann surfaces and Teichmuller theory, foliations, braids, topology are applied to approximation problems. The key feature of this book is the usage of beautiful ideas of contemporary mathematics for the solution of applied problems and their effective numerical realization. This is one of the few books where the computational aspects of the higher genus Riemann surfaces are illuminated. Effective work with the moduli spaces of algebraic curves provides wide opportunities for numerical experiments in mathematics and theoretical physics.

On the 8th of August 1900 outstanding German mathematician David Hilbert delivered a talk "Mathematical problems" at the Second Interna tional Congress of Mathematicians in Paris. The talk covered practically all directions of mathematical thought of that time and contained a list of 23 problems which determined the further development of mathema tics in many respects (1, 119]. Hilbert's Sixteenth Problem (the second part) was stated as follows: Problem. To find the maximum number and to determine the relative position of limit cycles of the equation dy Qn(X, y) -= dx Pn(x, y)' where Pn and Qn are polynomials of real variables x, y with real coeffi cients and not greater than n degree. The study of limit cycles is an interesting and very difficult problem of the qualitative theory of differential equations. This theory was origi nated at the end of the nineteenth century in the works of two geniuses of the world science: of the Russian mathematician A. M. Lyapunov and of the French mathematician Henri Poincare. A. M. Lyapunov set forth and solved completely in the very wide class of cases a special problem of the qualitative theory: the problem of motion stability (154]. In turn, H. Poincare stated a general problem of the qualitative analysis which was formulated as follows: not integrating the differential equation and using only the properties of its right-hand sides, to give as more as possi ble complete information on the qualitative behaviour of integral curves defined by this equation (176]."

Methods of global analysis and stochastic analysis are most often applied in mathematical physics as separate entities, thus forming important directions in the field. However, while combination of the two subject areas is rare, it is fundamental for the consideration of a broader class of problems. This book develops methods of Global Analysis and Stochastic Analysis such that their combination allows one to have a more or less common treatment for areas of mathematical physics that traditionally are considered as divergent and requiring different methods of investigation. Global and Stochastic Analysis with Applications to Mathematical Physics covers branches of mathematics that are currently absent in monograph form. Through the demonstration of new topics of investigation and results, both in traditional and more recent problems, this book offers a fresh perspective on ordinary and stochastic differential equations and inclusions (in particular, given in terms of Nelson's mean derivatives) on linear spaces and manifolds. Topics covered include classical mechanics on non-linear configuration spaces, problems of statistical and quantum physics, and hydrodynamics. A self-contained book that provides a large amount of preliminary material and recent results which will serve to be a useful introduction to the subject and a valuable resource for further research. It will appeal to researchers, graduate and PhD students working in global analysis, stochastic analysis and mathematical physics.

In the spectrum of mathematics, graph theory which studies a mathe matical structure on a set of elements with a binary relation, as a recognized discipline, is a relative newcomer. In recent three decades the exciting and rapidly growing area of the subject abounds with new mathematical devel opments and significant applications to real-world problems. More and more colleges and universities have made it a required course for the senior or the beginning postgraduate students who are majoring in mathematics, computer science, electronics, scientific management and others. This book provides an introduction to graph theory for these students. The richness of theory and the wideness of applications make it impossi ble to include all topics in graph theory in a textbook for one semester. All materials presented in this book, however, I believe, are the most classical, fundamental, interesting and important. The method we deal with the mate rials is to particularly lay stress on digraphs, regarding undirected graphs as their special cases. My own experience from teaching out of the subject more than ten years at University of Science and Technology of China (USTC) shows that this treatment makes hardly the course di: fficult, but much more accords with the essence and the development trend of the subject."

At first sight discrete and fractional programming techniques appear to be two com pletely unrelated fields in operations research. We will show how techniques in both fields can be applied separately and in a combined form to particular models in location analysis. Location analysis deals with the problem of deciding where to locate facilities, con sidering the clients to be served, in such a way that a certain criterion is optimized. The term "facilities" immediately suggests factories, warehouses, schools, etc., while the term "clients" refers to depots, retail units, students, etc. Three basic classes can be identified in location analysis: continuous location, network location and dis crete location. The differences between these fields arise from the structure of the set of possible locations for the facilities. Hence, locating facilities in the plane or in another continuous space corresponds to a continuous location model while finding optimal facility locations on the edges or vertices of a network corresponds to a net work location model. Finally, if the possible set of locations is a finite set of points we have a discrete location model. Each of these fields has been actively studied, arousing intense discussion on the advantages and disadvantages of each of them. The usual requirement that every point in the plane or on the network must be a candidate location point, is one of the mostly used arguments "against" continuous and network location models."

This work presents a thorough treatment of boundary element methods (BEM) for solving strongly elliptic boundary integral equations obtained from boundary reduction of elliptic boundary value problems in $\mathbb{R} DEGREES3$. The book is self-contained, the prerequisites on elliptic partial differential and integral equations being presented in Chapters 2 and 3. The main focus is on the development, analysis, and implementation of Galerkin boundary element methods, which is one of the most flexible and robust numerical discretization methods for integral equations. For the efficient realization of the Galerkin BEM, it is essential to replace time-consuming steps in the numerical solution process with fast algorithms. In Chapters 5-9 these methods are developed, analyzed, and formulated in an algorithmic

This work describes the propagation properties of the so-called symmetric interior penalty discontinuous Galerkin (SIPG) approximations of the 1-d wave equation. This is done by means of linear approximations on uniform meshes. First, a careful Fourier analysis is constructed, highlighting the coexistence of two Fourier spectral branches or spectral diagrams (physical and spurious) related to the two components of the numerical solution (averages and jumps). Efficient filtering mechanisms are also developed by means of techniques previously proved to be appropriate for classical schemes like finite differences or P1-classical finite elements. In particular, the work presents a proof that the uniform observability property is recovered uniformly by considering initial data with null jumps and averages given by a bi-grid filtering algorithm. Finally, the book explains how these results can be extended to other more sophisticated conforming and non-conforming finite element methods, in particular to quadratic finite elements, local discontinuous Galerkin methods and a version of the SIPG method adding penalization on the normal derivatives of the numerical solution at the grid points. This work is the first publication to contain a rigorous analysis of the discontinuous Galerkin methods for wave control problems. It will be of interest to a range of researchers specializing in wave approximations.

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.