In many dynamical systems, time delays arise because of the time it takes to measure system states, perceive and evaluate events, formulate decisions, and act on those decisions. The presence of delays may lead to undesirable outcomes; without an engineered design, the dynamics may underperform, oscillate, and even become unstable. How to study the stability of dynamical systems influenced by time delays is a fundamental question. Related issues include how much time delay the system can withstand without becoming unstable and how to change system parameters to render improved dynamic characteristics, utilize or tune the delay itself to improve dynamical behavior, and assess the stability and speed of response of the dynamics. Mastering Frequency Domain Techniques for the Stability Analysis of LTI Time Delay Systems addresses these questions for linear time-invariant (LTI) systems with an eigenvalue-based approach built upon frequency domain techniques. Readers will find key results from the literature, including all subtopics for those interested in deeper exploration. The book presents step-by-step demonstrations of all implementations-including those that require special care in mathematics and numerical implementation-from the simpler, more intuitive ones in the introductory chapters to the more complex ones found in the later chapters. Maple and MATLAB code is available from the author's website. This multipurpose book is intended for graduate students, instructors, and researchers working in control engineering, robotics, mechatronics, network control systems, human-in-the-loop systems, human-machine systems, remote control and tele-operation, transportation systems, energy systems, and process control, as well as for those working in applied mathematics, systems biology, and physics. It can be used as a primary text in courses on stability and control of time delay systems and as a supplementary text in courses in the above listed domains.

Over seventy years ago, Richard Bellman coined the term "the curse of dimensionality" to describe phenomena and computational challenges that arise in high dimensions. These challenges, in tandem with the ubiquity of high-dimensional functions in real-world applications, have led to a lengthy, focused research effort on high-dimensional approximation-that is, the development of methods for approximating functions of many variables accurately and efficiently from data. This book provides an in-depth treatment of one of the latest installments in this long and ongoing story: sparse polynomial approximation methods. These methods have emerged as useful tools for various high-dimensional approximation tasks arising in a range of applications in computational science and engineering. It begins with a comprehensive overview of best s-term polynomial approximation theory for holomorphic, high-dimensional functions, as well as a detailed survey of applications to parametric differential equations. It then describes methods for computing sparse polynomial approximations, focusing on least squares and compressed sensing techniques. Sparse Polynomial Approximation of High-Dimensional Functions presents the first comprehensive and unified treatment of polynomial approximation techniques that can mitigate the curse of dimensionality in high-dimensional approximation, including least squares and compressed sensing. It develops main concepts in a mathematically rigorous manner, with full proofs given wherever possible, and it contains many numerical examples, each accompanied by downloadable code. The authors provide an extensive bibliography of over 350 relevant references, with an additional annotated bibliography available on the book's companion website (www.sparse-hd-book.com). This text is aimed at graduate students, postdoctoral fellows, and researchers in mathematics, computer science, and engineering who are interested in high-dimensional polynomial approximation techniques.

2014 Reprint of 1959 Edition. Full facsimile of the original edition, not reproduced with Optical Recognition Software. In mathematics, particularly in algebraic geometry, complex analysis and number theory, an abelian variety is a projective algebraic variety that is also an algebraic group, i.e., has a group law that can be defined by regular functions. Abelian varieties are at the same time among the most studied objects in algebraic geometry and indispensable tools for much research on other topics in algebraic geometry and number theory. Serge Lang was a French-born American mathematician. He is known for his work in number theory and for his mathematics textbooks, including the influential Algebra. He was a member of the Bourbaki group.

A sequel to Lectures on Riemann Surfaces (Mathematical Notes, 1966), this volume continues the discussion of the dimensions of spaces of holomorphic cross-sections of complex line bundles over compact Riemann surfaces. Whereas the earlier treatment was limited to results obtainable chiefly by one-dimensional methods, the more detailed analysis presented here requires the use of various properties of Jacobi varieties and of symmetric products of Riemann surfaces, and so serves as a further introduction to these topics as well. The first chapter consists of a rather explicit description of a canonical basis for the Abelian differentials on a marked Riemann surface, and of the description of the canonical meromorphic differentials and the prime function of a marked Riemann surface. Chapter 2 treats Jacobi varieties of compact Riemann surfaces and various subvarieties that arise in determining the dimensions of spaces of holomorphic cross-sections of complex line bundles. In Chapter 3, the author discusses the relations between Jacobi varieties and symmetric products of Riemann surfaces relevant to the determination of dimensions of spaces of holomorphic cross-sections of complex line bundles. The final chapter derives Torelli's theorem following A. Weil, but in an analytical context. Originally published in 1973. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

An unabridged, unaltered printing of the Second Edition (1920), with original format, all footnotes and index: The Series of Natural Numbers - Definition of Number - Finitude and Mathematical Induction - The Definition of Order - Kinds of Relations - Similarity of Relations - Rational, Real, and Complex Numbers - Infinite Cardinal Numbers - Infinite Series and Ordinals - Limits and Continuity - Limits and Continuity of Functions - Selections and the Multiplicative Axiom - The Axiom of Infinity and Logical Types - Incompatibility and the Theory of Deductions - Propositional Functions - Descriptions - Classes - Mathematics and Logic - Index