This book contains the main results of the talks given at the workshop "Recent Advances in PDEs: Analysis, Numerics and Control", which took place in Sevilla (Spain) on January 25-27, 2017. The work comprises 12 contributions given by high-level researchers in the partial differential equation (PDE) area to celebrate the 60th anniversary of Enrique Fernandez-Cara (University of Sevilla). The main topics covered here are: Control and inverse problems, Analysis of Fluid mechanics and Numerical Analysis. The work is devoted to researchers in these fields.

The proceedings represent the state of knowledge in the area of algorithmic differentiation (AD). The 31 contributed papers presented at the AD2012 conference cover the application of AD to many areas in science and engineering as well as aspects of AD theory and its implementation in tools. For all papers the referees, selected from the program committee and the greater community, as well as the editors have emphasized accessibility of the presented ideas also to non-AD experts. In the AD tools arena new implementations are introduced covering, for example, Java and graphical modeling environments or join the set of existing tools for Fortran. New developments in AD algorithms target the efficiency of matrix-operation derivatives, detection and exploitation of sparsity, partial separability, the treatment of nonsmooth functions, and other high-level mathematical aspects of the numerical computations to be differentiated. Applications stem from the Earth sciences, nuclear engineering, fluid dynamics, and chemistry, to name just a few. In many cases the applications in a given area of science or engineering share characteristics that require specific approaches to enable AD capabilities or provide an opportunity for efficiency gains in the derivative computation. The description of these characteristics and of the techniques for successfully using AD should make the proceedings a valuable source of information for users of AD tools.

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.

This two-volume work introduces the theory and applications of Schur-convex functions. The first volume introduces concepts and properties of Schur-convex functions, including Schur-geometrically convex functions, Schur-harmonically convex functions, Schur-power convex functions, etc. and also discusses applications of Schur-convex functions in symmetric function inequalities.

Multibody Dynamics is an area of Computational Mechanics which blends together various disciplines such as structural dynamics, multi-physics - chanics, computational mathematics, control theory and computer science, in order to deliver methods and tools for the virtual prototyping of complex mechanical systems. Multibody dynamics plays today a central role in the modeling, analysis, simulation and optimization of mechanical systems in a variety of ?elds and for a wide range of industrial applications. The ECCOMAS Thematic Conference on Multibody Dynamics was ini- ated in Lisbon in 2003, and then continued in Madrid in 2005 with the goal of providing researchers in Multibody Dynamics with appropriate venues for exchanging ideas and results. The third edition of the Conference was held at the Politecnico di Milano, Milano, Italy, from June 25 to June 28, 2007. The Conference saw the participation of over 250 researchers from 32 di?- ent countries, presenting 209 technical papers, and proved to be an excellent forum for discussion and technical exchange on the most recent advances in this rapidly growing ?eld.

This unique book gives a comprehensive account of new mathematical tools used to solve polygon problems.

In the 20th and 21st centuries, many problems in mathematics, theoretical physics and theoretical chemistry - and more recently in molecular biology and bio-informatics - can be expressed as counting problems, in which specified graphs, or shapes, are counted.

One very special class of shapes is that of polygons. These are closed, connected paths in space. We usually sketch them in two-dimensions, but they can exist in any dimension. The typical questions asked include "how many are there of a given perimeter?," "how big is the average polygon of given perimeter?," and corresponding questions about the area or volume enclosed. That is to say "how many enclosing a given area?" and "how large is an average polygon of given area?" Simple though these questions are to pose, they are extraordinarily difficult to answer. They are important questions because of the application of polygon, and the related problems of polyomino and polycube counting, to phenomena occurring in the natural world, and also because the study of these problems has been responsible for the development of powerful new techniques in mathematics and mathematical physics, as well as in computer science. These new techniques then find application more broadly.

The book brings together chapters from many of the major contributors in the field. An introductory chapter giving the history of the problem is followed by fourteen further chapters describing particular aspects of the problem, and applications to biology, to surface phenomena and to computer enumeration methods.

This book elucidates how Finite Element methods look like from the perspective of Green's functions, and shows new insights into the mathematical theory of Finite Elements. Practically, this new view on Finite Elements enables the reader to better assess solutions of standard programs and to find better model of a given problem.
The book systematically introduces the basic concepts how Finite Elements fulfill the strategy of Green's functions and how approximating of Green's functions. It discusses in detail the discretization error and shows that are coherent with the strategy of "goal oriented refinement." The book also gives much attention to the dependencies of FE solutions from the parameter set of the model."

No author has gone as far as Doerfler in covering methods of mental calculation beyond simple arithmetic. Even if you have no interest in competing with computers you'll learn a great deal about number theory and the art of efficient computer programming. --Martin Gardner

This book arises from the INdAM Meeting "Complex and Symplectic Geometry", which was held in Cortona in June 2016. Several leading specialists, including young researchers, in the field of complex and symplectic geometry, present the state of the art of their research on topics such as the cohomology of complex manifolds; analytic techniques in Kahler and non-Kahler geometry; almost-complex and symplectic structures; special structures on complex manifolds; and deformations of complex objects. The work is intended for researchers in these areas.

Optical networks epitomize complex communication systems, and they comprise the Internet s infrastructural backbone. The first of its kind, this book develops the mathematical framework needed from a control perspective to tackle various game-theoretical problems in optical networks. In doing so, it aims to help design control algorithms that optimally allocate the resources of these networks. With its fresh problem-solving approach, Game Theory in Optical Networks is a unique resource for researchers, practitioners, and graduate students in applied mathematics and systems/control engineering, as well as those in electrical and computer engineering."

Starting with novel algorithms for optimally updating bounding volume hierarchies of objects undergoing arbitrary deformations, the author presents a new data structure that allows, for the first time, the computation of the penetration volume. The penetration volume is related to the water displacement of the overlapping region, and thus corresponds to a physically motivated and continuous force. The practicability of the approaches used is shown by realizing new applications in the field of robotics and haptics, including a user study that evaluates the influence of the degrees of freedom in complex haptic interactions. New Geometric Data Structures for Collision Detection and Haptics closes by proposing an open source benchmarking suite that evaluates both the performance and the quality of the collision response in order to guarantee a fair comparison of different collision detection algorithms. Required in the fields of computer graphics, physically-based simulations, computer animations, robotics and haptics, collision detection is a fundamental problem that arises every time we interact with virtual objects. Some of the open challenges associated with collision detection include the handling of deformable objects, the stable computation of physically-plausible contact information, and the extremely high frequencies that are required for haptic rendering. New Geometric Data Structures for Collision Detection and Haptics presents new solutions to all of these challenges, and will prove to be a valuable resource for researchers and practitioners of collision detection in the haptics, robotics and computer graphics and animation domains.

In January 2012 an Oberwolfach workshop took place on the topic of recent developments in the numerics of partial differential equations. Focus was laid on methods of high order and on applications in Computational Fluid Dynamics. The book covers most of the talks presented at this workshop.

This book covers Lebesgue integration and its generalizations from Daniell's point of view, modified by the use of seminorms. Integrating functions rather than measuring sets is posited as the main purpose of measure theory.

From this point of view Lebesgue's integral can be had as a rather straightforward, even simplistic, extension of Riemann's integral; and its aims, definitions, and procedures can be motivated at an elementary level. The notion of measurability, for example, is suggested by Littlewood's observations rather than being conveyed authoritatively through definitions of (sigma)-algebras and good-cut-conditions, the latter of which are hard to justify and thus appear mysterious, even nettlesome, to the beginner. The approach taken provides the additional benefit of cutting the labor in half. The use of seminorms, ubiquitous in modern analysis, speeds things up even further.

The book is intended for the reader who has some experience with proofs, a beginning graduate student for example. It might even be useful to the advanced mathematician who is confronted with situations - such as stochastic integration - where the set-measuring approach to integration does not work.

The book presents the method of difference potentials first proposed by the author in 1969 and contains illustrative examples and new algorithms for solving applied problems of gas dynamics, diffraction, scattering theory, and active noise screening. The fundamentals of the method are described in Parts I-III and its applications in Parts IV-VIII. To get acquainted with the basic ideas of the method, it suffices to study the Introduction. After this, each of the Parts VI-VIII can be read independently. The book is intended for specialists in the field of computational mathematics and the theory of differential and integral equations, as well as for graduate students of related specialities.

The Jacobi group is a semidirect product of a symplectic group with a Heisenberg group. It is an important example for a non-reductive group and sets the frame within which to treat theta functions as well as elliptic functions - in particular, the universal elliptic curve. This text gathers for the first time material from the representation theory of this group in both local (archimedean and non-archimedean) cases and in the global number field case. Via a bridge to Waldspurger's theory for the metaplectic group, complete classification theorems for irreducible representations are obtained. Further topics include differential operators, Whittaker models, Hecke operators, spherical representations and theta functions. The global theory is aimed at the correspondence between automorphic representations and Jacobi forms. This volume is thus a complement to the seminal book on Jacobi forms by M. Eichler and D. Zagier. Incorporating results of the authors' original research, this exposition is meant for researchers and graduate students interested in algebraic groups and number theory, in particular, modular and automorphic forms.

This book includes a collection of research articles presented at the "6th International Workshop on Hydro Scheduling in Competitive Electricity Markets". The workshop was a unique and intimate forum for researchers and practitioners to present state-of-the-art research and development concerning novel methodological findings, best practices and real-life applications of hydro scheduling. It also provided a platform for discussing the developments that are taking place in the industry, sharing different experiences and discussing future trends related to this area. This proceedings book is a collection of the most relevant, high-quality articles from the workshop. Discussing the state-of-the-art in the field of hydro scheduling, it is a valuable resource for a wide audience of researchers and practitioners in the field now and in the interesting and challenging times ahead.

Computer Science and Operations Research continue to have a synergistic relationship and this book represents the results of the cross-fertilization between OR/MS and CS/AI. It is this interface of OR/CS that makes possible advances that could not have been achieved in isolation. Taken collectively, these articles are indicative of the state of the art in the interface between OR/MS and CS/AI and of the high-caliber research being conducted by members of the INFORMS Computing Society.

My book "Asymptotic Expansions for Ordinary Differential Equations" published in 1965 is out of print. In the almost 20 years since then, the subject has grown so much in breadth and in depth that an account of the present state of knowledge of all the topics discussed there could not be fitted into one volume without resorting to an excessively terse style of writing. Instead of undertaking such a task, I have concentrated, in this exposi tion, on the aspects of the asymptotic theory with which I have been particularly concerned during those 20 years, which is the nature and structure of turning points. As in Chapter VIII of my previous book, only linear analytic differential equations are considered, but the inclusion of important new ideas and results, as well as the development of the neces sary background material have made this an exposition of book length. The formal theory of linear analytic differential equations without a parameter near singularities with respect to the independent variable has, in recent years, been greatly deepened by bringing to it methods of modern algebra and topology. It is very probable that many of these ideas could also be applied to the problems concerning singularities with respect to a parameter, and I hope that this will be done in the near future. It is less likely, however, that the analytic, as opposed to the formal, aspects of turning point theory will greatly benefit from such an algebraization."

Numerical Analysis, Second Edition, is a modern and readable text for the undergraduate audience. This book covers not only the standard topics but also some more advanced numerical methods being used by computational scientists and engineers-topics such as compression, forward and backward error analysis, and iterative methods of solving equations-all while maintaining a level of discussion appropriate for undergraduates. Each chapter contains a Reality Check, which is an extended exploration of relevant application areas that can launch individual or team projects. MATLAB(r) is used throughout to demonstrate and implement numerical methods. The Second Edition features many noteworthy improvements based on feedback from users, such as new coverage of Cholesky factorization, GMRES methods, and nonlinear PDEs.

Iteration regularization, i.e., utilization of iteration methods of any form for the stable approximate solution of ill-posed problems, is one of the most important but still insufficiently developed topics of the new theory of ill-posed problems. In this monograph, a general approach to the justification of iteration regulari zation algorithms is developed, which allows us to consider linear and nonlinear methods from unified positions. Regularization algorithms are the 'classical' iterative methods (steepest descent methods, conjugate direction methods, gradient projection methods, etc.) complemented by the stopping rule depending on level of errors in input data. They are investigated for solving linear and nonlinear operator equations in Hilbert spaces. Great attention is given to the choice of iteration index as the regularization parameter and to estimates of errors of approximate solutions. Stabilizing properties such as smoothness and shape constraints imposed on the solution are used. On the basis of these investigations, we propose and establish efficient regularization algorithms for stable numerical solution of a wide class of ill-posed problems. In particular, descriptive regularization algorithms, utilizing a priori information about the qualitative behavior of the sought solution and ensuring a substantial saving in computational costs, are considered for model and applied problems in nonlinear thermophysics. The results of calculations for important applications in various technical fields (a continuous casting, the treatment of materials and perfection of heat-protective systems using laser and composite technologies) are given."

Combinatorial optimization algorithms are used in many applications including the design, management, and operations of communication networks. The objective of this book is to advance and promote the theory and applications of combinatorial optimization in communication networks. Each chapter of the book is written by an expert dealing with theoretical, computational, or applied aspects of combinatorial optimization. Topics covered in the book include the combinatorial optimization problems arising in optical networks, wireless ad hoc networks, sensor networks, mobile communication systems, and satellite networks. A variety of problems are addressed using combinatorial optimization techniques, ranging from routing and resource allocation to QoS provisioning.

These proceedings are based on papers presented at the international conference Approximation Theory XV, which was held May 22-25, 2016 in San Antonio, Texas. The conference was the fifteenth in a series of meetings in Approximation Theory held at various locations in the United States, and was attended by 146 participants. The book contains longer survey papers by some of the invited speakers covering topics such as compressive sensing, isogeometric analysis, and scaling limits of polynomials and entire functions of exponential type. The book also includes papers on a variety of current topics in Approximation Theory drawn from areas such as advances in kernel approximation with applications, approximation theory and algebraic geometry, multivariate splines for applications, practical function approximation, approximation of PDEs, wavelets and framelets with applications, approximation theory in signal processing, compressive sensing, rational interpolation, spline approximation in isogeometric analysis, approximation of fractional differential equations, numerical integration formulas, and trigonometric polynomial approximation.

"Optimization on Metric and Normed Spaces" is devoted to the recent progress in optimization on Banach spaces and complete metric spaces. Optimization problems are usually considered on metric spaces satisfying certain compactness assumptions which guarantee the existence of solutions and convergence of algorithms. This book considers spaces that do not satisfy such compactness assumptions. In order to overcome these difficulties, the book uses the Baire category approach and considers approximate solutions. Therefore, it presents a number of new results concerning penalty methods in constrained optimization, existence of solutions in parametric optimization, well-posedness of vector minimization problems, and many other results obtained in the last ten years. The book is intended for mathematicians interested in optimization and applied functional analysis.

The objective of this book is to advance the current knowledge of sensor research particularly highlighting recent advances, current work, and future needs. The goal is to share current technologies and steer future efforts in directions that will benefit the majority of researchers and practitioners working in this broad field of study.

This monograph is a first in the world to present three approaches for stability analysis of solutions of dynamic equations. The first approach is based on the application of dynamic integral inequalities and the fundamental matrix of solutions of linear approximation of dynamic equations. The second is based on the generalization of the direct Lyapunovs method for equations on time scales, using scalar, vector and matrix-valued auxiliary functions. The third approach is the application of auxiliary functions (scalar, vector, or matrix-valued ones) in combination with differential dynamic inequalities. This is an alternative comparison method, developed for time continuous and time discrete systems.In recent decades, automatic control theory in the study of air- and spacecraft dynamics and in other areas of modern applied mathematics has encountered problems in the analysis of the behavior of solutions of time continuous-discrete linear and/or nonlinear equations of perturbed motion. In the book "Men of Mathematics," 1937, E.T.Bell wrote: "A major task of mathematics today is to harmonize the continuous and the discrete, to include them in one comprehensive mathematics, and to eliminate obscurity from both."Mathematical analysis on time scales accomplishes exactly this. This research has potential applications in such areas as theoretical and applied mechanics, neurodynamics, mathematical biology and finance among others.