Books and proceedings
  1. V.D. Blondel, E.D Sontag, M. Vidyasagar, and J.C. Willems. Open Problems in Mathematical Systems and Control Theory (edited book). Springer Verlag, 1999.

  1. E.D. Sontag. Mathematical Control Theory. Deterministic Finite-Dimensional Systems, volume 6 of Texts in Applied Mathematics. Springer-Verlag, New York, Second edition, 1998. [PDF]
    This book is copyrighted by Springer-Verlag. Springer has kindly allowed me to place a copy on the web, as a reference and for ease of web searches. Please consider buying your own hardcopy.

  1. R. Alur, T.A. Henzinger, and E.D. Sontag. Hybrid Systems III. Verification and Control (edited book). Springer Verlag, Berlin, 1996. Note: (LNCS 1066).

  1. E.D. Sontag. Mathematical Control Theory. Deterministic Finite-Dimensional Systems, volume 6 of Texts in Applied Mathematics. Springer-Verlag, New York, 1990.
    The second edition (1998) is now online; please follow that link.

  1. B.N. Datta, C.R. Johnson, M.A. Kaashoek, R.J. Plemmons, and E.D. Sontag. Linear Algebra in Signals, Systems, and Control (edited book). SIAM, 1988.

  1. E.D. Sontag. Polynomial Response Maps, volume 13 of Lecture Notes in Control and Information Sciences. Springer-Verlag, Berlin, 1979. [PDF] Keyword(s): realization theory, discrete-time, real algebraic geometry.
    (This is a monograph based upon Eduardo Sontag's Ph.D. thesis. The contents are basically the same as the thesis, except for a very few revisions and extensions.) This work deals the realization theory of discrete-time systems (with inputs and outputs, in the sense of control theory) defined by polynomial update equations. It is based upon the premise that the natural tools for the study of the structural-algebraic properties (in particular, realization theory) of polynomial input/output maps are provided by algebraic geometry and commutative algebra, perhaps as much as linear algebra provides the natural tools for studying linear systems. Basic ideas from algebraic geometry are used throughout in system-theoretic applications (Hilbert's basis theorem to finite-time observability, dimension theory to minimal realizations, Zariski's Main Theorem to uniqueness of canonical realizations, etc). In order to keep the level elementary (in particular, not utilizing sheaf-theoretic concepts), certain ideas like nonaffine varieties are used only implicitly (eg., quasi-affine as open sets in affine varieties) or in technical parts of a few proofs, and the terminology is similarly simplified (e.g., "polynomial map" instead of "scheme morphism restricted to k-points", or "k-space" instead of "k-points of an affine k-scheme").

  1. E.D. Sontag. Temas de Inteligencia Artificial. PROLAM, Buenos Aires, 1972. [PDF] Keyword(s): artificial intelligence.
    Textbook on Artificial Intelligence. Scanned 2005. The complete pdf file is 16 Megabytes. (Libro de texto con introduccion a la inteligencia artificial. El pdf file completo tiene 16 Megabytes.)



This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders.

Last modified: Tue Aug 8 10:06:29 2017
Author: sontag.

This document was translated from BibTEX by bibtex2html