Publications by Eduardo D. Sontag in year 1988
Books and proceedings
  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.

Articles in journal or book chapters
  1. E.D. Sontag. A Chow property for sampled bilinear systems. In C.I. Byrnes, C.F. Martin, and R. Saeks, editors, Analysis and Control of Nonlinear Systems, pages 205-211. North Holland, Amsterdam, 1988. [PDF] Keyword(s): discrete-time, bilinear systems.
    This paper studies accessibility (weak controllability) of bilinear systems under constant sampling rates. It is shown that the property is preserved provided that the sampling period satisfies a condition related to the eigenvalues of the autonomous dynamics matrix. This condition generalizes the classical Kalman-Ho-Narendra criterion which is well known in the linear case, and which, for observability, results in the classical Nyquist theorem.

  2. E.D. Sontag. An explicit construction of the equilinearization controller. In C.I. Byrnes, C.F. Martin, and R. Saek, editors, Analysis and Control of Nonlinear Systems, pages 483-492. North Holland, Amsterdam, 1988. [PDF]
    This paper provides further results about the equilinearization method of control design recently introduced by the author. A simplified derivation of the controller is provided, as well as a theorem on local stabilization along reference trajectories.

  3. E.D. Sontag. Bilinear realizability is equivalent to existence of a singular affine differential I/O equation. Systems Control Lett., 11(3):181-187, 1988. [PDF] [doi:] Keyword(s): identification, identifiability, observability, observation space, real-analytic functions.
    For continuous time analytic input/output maps, the existence of a singular differential equation relating derivatives of controls and outputs is shown to be equivalent to bilinear realizability. A similar result holds for the problem of immersion into bilinear systems. The proof is very analogous to that of the corresponding, and previously known, result for discrete time.

  4. E.D. Sontag. Controllability is harder to decide than accessibility. SIAM J. Control Optim., 26(5):1106-1118, 1988. [PDF] [doi:] Keyword(s): computational complexity, controllability, computational complexity.
    The present article compares the difficulties of deciding controllability and accessibility. These are standard properties of control systems, but complete algebraic characterizations of controllability have proved elusive. We show in particular that for subsystems of bilinear systems, accessibility can be decided in polynomial time, but controllability is NP-hard.

  5. E.D. Sontag. Finite-dimensional open-loop control generators for nonlinear systems. Internat. J. Control, 47(2):537-556, 1988. [PDF]
    This paper concerns itself with the existence of open-loop control generators for nonlinear (continuous-time) systems. The main result is that, under relatively mild assumptions on the original system, and for each fixed compact subset of the state space, there always exists one such generator. This is a new system with the property that the controls it produces are sufficiently rich to preserve complete controllability along nonsingular trajectories. General results are also given on the continuity and differentiability of the input to state mapping for various p-norms on controls, as well as a comparison of various nonlinear controllability notions.

Conference articles
  1. E.D. Sontag. Some complexity questions regarding controllability. In Proc. IEEE Conf. Decision and Control, Austin, Dec. 1988, pages 1326-1329, 1988. [PDF] Keyword(s): theory of computing and complexity, computational complexity, controllability, computational complexity.
    It has been known for a long time that certain controllability properties are more difficult to verify than others. This article makes this fact precise, comparing controllability with accessibility, for a wide class of nonlinear continuous time systems. The original contribution is in formalizing this comparison in the context of computational complexity. (This paper placed here by special request.)

  2. E.D. Sontag. Stabilizability, i/o stability, and coprime factorizations. In Proc. IEEE Conf. Decision and Control, Austin, Dec. 1988, pages 457-458, 1988. Keyword(s): input to state stability, coprime factorizations, stabilization.

Internal reports
  1. E.D. Sontag. Integrability of certain distributions associated to actions on manifolds and an introduction to Lie-algebraic control. Technical report SYCON-88-04, Rutgers Center for Systems and Control, 1988.

  2. E.D. Sontag. Some remarks on the backpropagation algorithm for neural net learning. Technical report SYCON-88-02, Rutgers Center for Systems and Control, 1988. [PDF] Keyword(s): machine learning, neural networks.
    This is a very old informal report that discusses the study of local minima of quadratic loss functions for fitting errors in sigmoidal neural net learning. It also includes several remarks concerning the growth of weights during gradient descent. There is nothing very interesting here - far better knowledge is now available - but the report was placed here by request.



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: Sat Dec 2 22:29:18 2023
Author: sontag.

This document was translated from BibTEX by bibtex2html