Boundary recursion for descriptor variable systems

DOI10.1109/9.16418zbMath0674.93043OpenAlexW2114900997MaRDI QIDQ3829443

David G. Luenberger

Publication date: 1989

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.16418

zbMATH Keywords

solvabilityboundary recursionconditionabilityboundary mapping equation

Mathematics Subject Classification ID

Discrete-time control/observation systems (93C55) Linear systems in control theory (93C05) Discrete version of topics in analysis (39A12) General theory for ordinary differential equations (34A99)

Related Items (10)

Evaluating products of matrix pencils and collapsing matrix products ⋮ Periodic two-dimensional descriptor systems ⋮ A tutorial on the geometric analysis of linear time-invariant implicit systems ⋮ A new sufficient condition for checking the robust stabilization of uncertain descriptor fractional-order systems ⋮ A review of 2-D implicit systems ⋮ A new notion of equivalence for discrete time AR representations ⋮ An arithmetic for matrix pencils: theory and new algorithms ⋮ Computing the zeros of periodic descriptor systems ⋮ Unnamed Item ⋮ Exact solution of corner-modified banded block-Toeplitz eigensystems

This page was built for publication: Boundary recursion for descriptor variable systems