Geometric Methods in System Theory
Geometric Methods in System Theory

Author: D.Q. Mayne

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 322

ISBN-13: 9401026750

DOWNLOAD EBOOK

Geometric Methods in System Theory In automatic control there are a large number of applications of a fairly simple type for which the motion of the state variables is not free to evolve in a vector space but rather must satisfy some constraints. Examples are numerous; in a switched, lossless electrical network energy is conserved and the state evolves on an ellipsoid surface defined by x'Qx equals a constant; in the control of finite state, continuous time, Markov processes the state evolves on the set x'x = 1, xi ~ O. The control of rigid body motions and trajectory control leads to problems of this type. There has been under way now for some time an effort to build up enough control theory to enable one to treat these problems in a more or less routine way. It is important to emphasise that the ordinary vector space-linear theory often gives the wrong insight and thus should not be relied upon.

Geometrical Methods for the Theory of Linear Systems
Geometrical Methods for the Theory of Linear Systems

Author: C.I. Byrnes

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 320

ISBN-13: 9400990820

DOWNLOAD EBOOK

The lectures contained in this book were presented at Harvard University in June 1979. The workshop at which they were presented was the third such on algebro-geometric methods. The first was held in 1973 in London and the emphasis was largely on geometric methods. The second was held at Ames Research Center-NASA in 1976. There again the emphasis was on geometric methods, but algebraic geometry was becoming a dominant theme. In the two years after the Ames meeting there was tremendous growth in the applications of algebraic geometry to systems theory and it was becoming clear that much of the algebraic systems theory was very closely related to the geometric systems theory. On this basis we felt that this was the right time to devote a workshop to the applications of algebra and algebraic geometry to linear systems theory. The lectures contained in this volume represent all but one of the tutorial lectures presented at the workshop. The lec ture of Professor Murray Wonham is not contained in this volume and we refer the interested to the archival literature. This workshop was jointly sponsored by a grant from Ames Research Center-NASA and a grant from the Advanced Study Institute Program of NATO. We greatly appreciate the financial support rendered by these two organizations. The American Mathematical Society hosted this meeting as part of their Summer Seminars in Applied Mathematics and will publish the companion volume of con tributed papers.

Complexity and Real Computation
Complexity and Real Computation

Author: Lenore Blum

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 456

ISBN-13: 1461207010

DOWNLOAD EBOOK

The classical theory of computation has its origins in the work of Goedel, Turing, Church, and Kleene and has been an extraordinarily successful framework for theoretical computer science. The thesis of this book, however, is that it provides an inadequate foundation for modern scientific computation where most of the algorithms are real number algorithms. The goal of this book is to develop a formal theory of computation which integrates major themes of the classical theory and which is more directly applicable to problems in mathematics, numerical analysis, and scientific computing. Along the way, the authors consider such fundamental problems as: * Is the Mandelbrot set decidable? * For simple quadratic maps, is the Julia set a halting set? * What is the real complexity of Newton's method? * Is there an algorithm for deciding the knapsack problem in a ploynomial number of steps? * Is the Hilbert Nullstellensatz intractable? * Is the problem of locating a real zero of a degree four polynomial intractable? * Is linear programming tractable over the reals? The book is divided into three parts: The first part provides an extensive introduction and then proves the fundamental NP-completeness theorems of Cook-Karp and their extensions to more general number fields as the real and complex numbers. The later parts of the book develop a formal theory of computation which integrates major themes of the classical theory and which is more directly applicable to problems in mathematics, numerical analysis, and scientific computing.

Impulsive Control in Continuous and Discrete-Continuous Systems
Impulsive Control in Continuous and Discrete-Continuous Systems

Author: Boris M. Miller

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 454

ISBN-13: 1461500958

DOWNLOAD EBOOK

Impulsive Control in Continuous and Discrete-Continuous Systems is an up-to-date introduction to the theory of impulsive control in nonlinear systems. This is a new branch of the Optimal Control Theory, which is tightly connected to the Theory of Hybrid Systems. The text introduces the reader to the interesting area of optimal control problems with discontinuous solutions, discussing the application of a new and effective method of discontinuous time-transformation. With a large number of examples, illustrations, and applied problems arising in the area of observation control, this book is excellent as a textbook or reference for a senior or graduate-level course on the subject, as well as a reference for researchers in related fields.