Bücher der Reihe Princeton Series in Applied Mathematics

Trains pull into a railroad station and must wait for each other before leaving again in order to let passengers change trains. How do mathematicians then calculate a railroad timetable that accurately reflects their comings and goings? One approach is to use max-plus algebra, a framework used to model Discrete Event Systems, which are well suited to describe the ordering and timing of events. This is the first textbook on max-plus algebra, providing a concise and self-contained introduction to the topic. Applications of max-plus algebra abound in the world around us. Traffic systems, computer communication systems, production lines, and flows in networks are all based on discrete even systems, and thus can be conveniently described and analyzed by means of max-plus algebra. The book consists of an introduction and thirteen chapters in three parts. Part One explores the introduction of max-plus algebra and of system descriptions based upon it. Part Two deals with a real application, namely the design of timetables for railway networks. Part Three examines various extensions, such as stochastic systems and min-max-plus systems. The text is suitable for last-year undergraduates in mathematics, and each chapter provides exercises, notes, and a reference section.

Rabinowitz's classical global bifurcation theory, which concerns the study in-the-large of parameter-dependent families of nonlinear equations, uses topological methods that address the problem of continuous parameter dependence of solutions by showing that there are connected sets of solutions of global extent. Even when the operators are infinitely differentiable in all the variables and parameters, connectedness here cannot in general be replaced by path-connectedness. However, in the context of real-analyticity there is an alternative theory of global bifurcation due to Dancer, which offers a much stronger notion of parameter dependence. This book aims to develop from first principles Dancer's global bifurcation theory for one-parameter families of real-analytic operators in Banach spaces. It shows that there are globally defined continuous and locally real-analytic curves of solutions. In particular, in the real-analytic setting, local analysis can lead to global consequences--for example, as explained in detail here, those resulting from bifurcation from a simple eigenvalue. Included are accounts of analyticity and implicit function theorems in Banach spaces, classical results from the theory of finite-dimensional analytic varieties, and the links between these two and global existence theory. Laying the foundations for more extensive studies of real-analyticity in infinite-dimensional problems and illustrating the theory with examples, Analytic Theory of Global Bifurcation is intended for graduate students and researchers in pure and applied analysis.

Many industries, such as transportation and manufacturing, use control systems to insure that parameters such as temperature or altitude behave in a desirable way over time. For example, pilots need assurance that the plane they are flying will maintain a particular heading. An integral part of control systems is a mechanism for failure detection to insure safety and reliability. This book offers an alternative failure detection approach that addresses two of the fundamental problems in the safe and efficient operation of modern control systems: failure detection--deciding when a failure has occurred--and model identification--deciding which kind of failure has occurred. Much of the work in both categories has been based on statistical methods and under the assumption that a given system was monitored passively. Campbell and Nikoukhah's book proposes an "e;active"e; multimodel approach. It calls for applying an auxiliary signal that will affect the output so that it can be used to easily determine if there has been a failure and what type of failure it is. This auxiliary signal must be kept small, and often brief in duration, in order not to interfere with system performance and to ensure timely detection of the failure. The approach is robust and uses tools from robust control theory. Unlike some approaches, it is applicable to complex systems. The authors present the theory in a rigorous and intuitive manner and provide practical algorithms for implementation of the procedures.

This book provides a wide variety of state-space--based numerical algorithms for the synthesis of feedback algorithms for linear systems with input saturation. Specifically, it addresses and solves the anti-windup problem, presenting the objectives and terminology of the problem, the mathematical tools behind anti-windup algorithms, and more than twenty algorithms for anti-windup synthesis, illustrated with examples. Luca Zaccarian and Andrew Teel's modern method--combining a state-space approach with algorithms generated by solving linear matrix inequalities--treats MIMO and SISO systems with equal ease. The book, aimed at control engineers as well as graduate students, ranges from very simple anti-windup construction to sophisticated anti-windup algorithms for nonlinear systems. Describes the fundamental objectives and principles behind anti-windup synthesis for control systems with actuator saturation Takes a modern, state-space approach to synthesis that applies to both SISO and MIMO systems Presents algorithms as linear matrix inequalities that can be readily solved with widely available software Explains mathematical concepts that motivate synthesis algorithms Uses nonlinear performance curves to quantify performance relative to disturbances of varying magnitudes Includes anti-windup algorithms for a class of Euler-Lagrange nonlinear systems Traces the history of anti-windup research through an extensive annotated bibliography

Splines, both interpolatory and smoothing, have a long and rich history that has largely been application driven. This book unifies these constructions in a comprehensive and accessible way, drawing from the latest methods and applications to show how they arise naturally in the theory of linear control systems. Magnus Egerstedt and Clyde Martin are leading innovators in the use of control theoretic splines to bring together many diverse applications within a common framework. In this book, they begin with a series of problems ranging from path planning to statistics to approximation. Using the tools of optimization over vector spaces, Egerstedt and Martin demonstrate how all of these problems are part of the same general mathematical framework, and how they are all, to a certain degree, a consequence of the optimization problem of finding the shortest distance from a point to an affine subspace in a Hilbert space. They cover periodic splines, monotone splines, and splines with inequality constraints, and explain how any finite number of linear constraints can be added. This book reveals how the many natural connections between control theory, numerical analysis, and statistics can be used to generate powerful mathematical and analytical tools. This book is an excellent resource for students and professionals in control theory, robotics, engineering, computer graphics, econometrics, and any area that requires the construction of curves based on sets of raw data.

The classical Melnikov method provides information on the behavior of deterministic planar systems that may exhibit transitions, i.e. escapes from and captures into preferred regions of phase space. This book develops a unified treatment of deterministic and stochastic systems that extends the applicability of the Melnikov method to physically realizable stochastic planar systems with additive, state-dependent, white, colored, or dichotomous noise. The extended Melnikov method yields the novel result that motions with transitions are chaotic regardless of whether the excitation is deterministic or stochastic. It explains the role in the occurrence of transitions of the characteristics of the system and its deterministic or stochastic excitation, and is a powerful modeling and identification tool. The book is designed primarily for readers interested in applications. The level of preparation required corresponds to the equivalent of a first-year graduate course in applied mathematics. No previous exposure to dynamical systems theory or the theory of stochastic processes is required. The theoretical prerequisites and developments are presented in the first part of the book. The second part of the book is devoted to applications, ranging from physics to mechanical engineering, naval architecture, oceanography, nonlinear control, stochastic resonance, and neurophysiology.

This book develops a general analysis and synthesis framework for impulsive and hybrid dynamical systems. Such a framework is imperative for modern complex engineering systems that involve interacting continuous-time and discrete-time dynamics with multiple modes of operation that place stringent demands on controller design and require implementation of increasing complexity--whether advanced high-performance tactical fighter aircraft and space vehicles, variable-cycle gas turbine engines, or air and ground transportation systems. Impulsive and Hybrid Dynamical Systems goes beyond similar treatments by developing invariant set stability theorems, partial stability, Lagrange stability, boundedness, ultimate boundedness, dissipativity theory, vector dissipativity theory, energy-based hybrid control, optimal control, disturbance rejection control, and robust control for nonlinear impulsive and hybrid dynamical systems. A major contribution to mathematical system theory and control system theory, this book is written from a system-theoretic point of view with the highest standards of exposition and rigor. It is intended for graduate students, researchers, and practitioners of engineering and applied mathematics as well as computer scientists, physicists, and other scientists who seek a fundamental understanding of the rich dynamical behavior of impulsive and hybrid dynamical systems.

Provides surveys of the uses and concepts of entropy in diverse areas of mathematics and the physical sciences. This book starts by providing basic concepts and terminology, illustrated by examples from both the macroscopic and microscopic lines of thought. In-depth surveys covering the macroscopic, microscopic and probabilistic approaches follow.

This book places thermodynamics on a system-theoretic foundation so as to harmonize it with classical mechanics. Using the highest standards of exposition and rigor, the authors develop a novel formulation of thermodynamics that can be viewed as a moderate-sized system theory as compared to statistical thermodynamics. This middle-ground theory involves deterministic large-scale dynamical system models that bridge the gap between classical and statistical thermodynamics. The authors' theory is motivated by the fact that a discipline as cardinal as thermodynamics--entrusted with some of the most perplexing secrets of our universe--demands far more than physical mathematics as its underpinning. Even though many great physicists, such as Archimedes, Newton, and Lagrange, have humbled us with their mathematically seamless eurekas over the centuries, this book suggests that a great many physicists and engineers who have developed the theory of thermodynamics seem to have forgotten that mathematics, when used rigorously, is the irrefutable pathway to truth. This book uses system theoretic ideas to bring coherence, clarity, and precision to an extremely important and poorly understood classical area of science.

This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us.

Presents an introduction to the theory of algebraic curves over a finite field, a subject that has applications in areas such as finite geometry, number theory, error-correcting codes, and cryptology. This book emphasizes the algebraic geometry rather than the function field approach to algebraic curves.

This book offers the first comprehensive introduction to wave scattering in nonstationary materials. G. F. Roach's aim is to provide an accessible, self-contained resource for newcomers to this important field of research that has applications across a broad range of areas, including radar, sonar, diagnostics in engineering and manufacturing, geophysical prospecting, and ultrasonic medicine such as sonograms. New methods in recent years have been developed to assess the structure and properties of materials and surfaces. When light, sound, or some other wave energy is directed at the material in question, "e;imperfections"e; in the resulting echo can reveal a tremendous amount of valuable diagnostic information. The mathematics behind such analysis is sophisticated and complex. However, while problems involving stationary materials are quite well understood, there is still much to learn about those in which the material is moving or changes over time. These so-called non-autonomous problems are the subject of this fascinating book. Roach develops practical strategies, techniques, and solutions for mathematicians and applied scientists working in or seeking entry into the field of modern scattering theory and its applications. Wave Scattering by Time-Dependent Perturbations is destined to become a classic in this rapidly evolving area of inquiry.

The modeling of stochastic dependence is fundamental for understanding random systems evolving in time. When measured through linear correlation, many of these systems exhibit a slow correlation decay--a phenomenon often referred to as long-memory or long-range dependence. An example of this is the absolute returns of equity data in finance. Selfsimilar stochastic processes (particularly fractional Brownian motion) have long been postulated as a means to model this behavior, and the concept of selfsimilarity for a stochastic process is now proving to be extraordinarily useful. Selfsimilarity translates into the equality in distribution between the process under a linear time change and the same process properly scaled in space, a simple scaling property that yields a remarkably rich theory with far-flung applications. After a short historical overview, this book describes the current state of knowledge about selfsimilar processes and their applications. Concepts, definitions and basic properties are emphasized, giving the reader a road map of the realm of selfsimilarity that allows for further exploration. Such topics as noncentral limit theory, long-range dependence, and operator selfsimilarity are covered alongside statistical estimation, simulation, sample path properties, and stochastic differential equations driven by selfsimilar processes. Numerous references point the reader to current applications. Though the text uses the mathematical language of the theory of stochastic processes, researchers and end-users from such diverse fields as mathematics, physics, biology, telecommunications, finance, econometrics, and environmental science will find it an ideal entry point for studying the already extensive theory and applications of selfsimilarity.

Genomic signal processing (GSP) can be defined as the analysis, processing, and use of genomic signals to gain biological knowledge, and the translation of that knowledge into systems-based applications that can be used to diagnose and treat genetic diseases. Situated at the crossroads of engineering, biology, mathematics, statistics, and computer science, GSP requires the development of both nonlinear dynamical models that adequately represent genomic regulation, and diagnostic and therapeutic tools based on these models. This book facilitates these developments by providing rigorous mathematical definitions and propositions for the main elements of GSP and by paying attention to the validity of models relative to the data. Ilya Shmulevich and Edward Dougherty cover real-world situations and explain their mathematical modeling in relation to systems biology and systems medicine. Genomic Signal Processing makes a major contribution to computational biology, systems biology, and translational genomics by providing a self-contained explanation of the fundamental mathematical issues facing researchers in four areas: classification, clustering, network modeling, and network intervention.

Research on interior-point methods (IPMs) has dominated the field of mathematical programming for the last two decades. Two contrasting approaches in the analysis and implementation of IPMs are the so-called small-update and large-update methods, although, until now, there has been a notorious gap between the theory and practical performance of these two strategies. This book comes close to bridging that gap, presenting a new framework for the theory of primal-dual IPMs based on the notion of the self-regularity of a function. The authors deal with linear optimization, nonlinear complementarity problems, semidefinite optimization, and second-order conic optimization problems. The framework also covers large classes of linear complementarity problems and convex optimization. The algorithm considered can be interpreted as a path-following method or a potential reduction method. Starting from a primal-dual strictly feasible point, the algorithm chooses a search direction defined by some Newton-type system derived from the self-regular proximity. The iterate is then updated, with the iterates staying in a certain neighborhood of the central path until an approximate solution to the problem is found. By extensively exploring some intriguing properties of self-regular functions, the authors establish that the complexity of large-update IPMs can come arbitrarily close to the best known iteration bounds of IPMs. Researchers and postgraduate students in all areas of linear and nonlinear optimization will find this book an important and invaluable aid to their work.

Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of the subject. Robust optimization is designed to meet some major challenges associated with uncertainty-affected optimization problems: to operate under lack of full information on the nature of uncertainty; to model the problem in a form that can be solved efficiently; and to provide guarantees about the performance of the solution. The book starts with a relatively simple treatment of uncertain linear programming, proceeding with a deep analysis of the interconnections between the construction of appropriate uncertainty sets and the classical chance constraints (probabilistic) approach. It then develops the robust optimization theory for uncertain conic quadratic and semidefinite optimization problems and dynamic (multistage) problems. The theory is supported by numerous examples and computational illustrations. An essential book for anyone working on optimization and decision making under uncertainty, Robust Optimization also makes an ideal graduate textbook on the subject.

This self-contained textbook is an informal introduction to optimization through the use of numerous illustrations and applications. The focus is on analytically solving optimization problems with a finite number of continuous variables. In addition, the authors provide introductions to classical and modern numerical methods of optimization and to dynamic optimization. The book's overarching point is that most problems may be solved by the direct application of the theorems of Fermat, Lagrange, and Weierstrass. The authors show how the intuition for each of the theoretical results can be supported by simple geometric figures. They include numerous applications through the use of varied classical and practical problems. Even experts may find some of these applications truly surprising. A basic mathematical knowledge is sufficient to understand the topics covered in this book. More advanced readers, even experts, will be surprised to see how all main results can be grounded on the Fermat-Lagrange theorem. The book can be used for courses on continuous optimization, from introductory to advanced, for any field for which optimization is relevant.

This book represents the first synthesis of the considerable body of new research into positive definite matrices. These matrices play the same role in noncommutative analysis as positive real numbers do in classical analysis. They have theoretical and computational uses across a broad spectrum of disciplines, including calculus, electrical engineering, statistics, physics, numerical analysis, quantum information theory, and geometry. Through detailed explanations and an authoritative and inspiring writing style, Rajendra Bhatia carefully develops general techniques that have wide applications in the study of such matrices. Bhatia introduces several key topics in functional analysis, operator theory, harmonic analysis, and differential geometry--all built around the central theme of positive definite matrices. He discusses positive and completely positive linear maps, and presents major theorems with simple and direct proofs. He examines matrix means and their applications, and shows how to use positive definite functions to derive operator inequalities that he and others proved in recent years. He guides the reader through the differential geometry of the manifold of positive definite matrices, and explains recent work on the geometric mean of several matrices. Positive Definite Matrices is an informative and useful reference book for mathematicians and other researchers and practitioners. The numerous exercises and notes at the end of each chapter also make it the ideal textbook for graduate-level courses.