• DocumentCode
    967368
  • Title

    Boundary recursion for descriptor variable systems

  • Author

    Luenberger, David G.

  • Author_Institution
    Dept. of Eng.-Econ. Syst., Stanford Univ., CA, USA
  • Volume
    34
  • Issue
    3
  • fYear
    1989
  • fDate
    3/1/1989 12:00:00 AM
  • Firstpage
    287
  • Lastpage
    292
  • Abstract
    It is shown that if an n-dimensional descriptor variable system satisfies the properties of solvability and controllability, the family of solutions is n-dimensional and the set of two-point boundary values that are consistent with the system can be expressed as the solutions to a linear system of equations involving only the boundary values. This equation is termed a boundary mapping equation and it provides a compact representation of the system. The boundary mapping generalizes the state-transition matrix associated with state variable systems. The author presents the boundary mapping theory, describes the recursive processes required, and applies both to some special cases, including general linear time-invariant systems and adjoint systems
  • Keywords
    control system analysis; controllability; linear systems; multidimensional systems; state-space methods; adjoint systems; boundary mapping; boundary recursion; controllability; linear time-invariant systems; multidimensional descriptor variable systems; solvability; state-transition matrix; two-point boundary values; Boundary conditions; Equations; Input variables; Linear systems; Optimal control; Power generation economics; Simultaneous localization and mapping; Systems engineering and theory; Vectors;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/9.16418
  • Filename
    16418