Realization algorithms for systems over a principal ideal domain

DOI10.1007/BF01752406zbMath0436.93010OpenAlexW2054066263MaRDI QIDQ3877484

M. L. J. Hautus, Rikus Eising

Publication date: 1981

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01752406

zbMATH Keywords

realization algorithms

Mathematics Subject Classification ID

Related Items (13)

Minimal state space realizations in Jacobson normal form ⋮ Proper stable Bezout factorizations and feedback control of linear time-delay systems† ⋮ First-order representations of delay-differential systems in a behavioural setting ⋮ Adaptive decoupling control of linear systems without a persistent excitation requirement ⋮ Realization of dynamical systems in scales of systems with aftereffect. I: Realizability ⋮ Realization theory in Hilbert space ⋮ Canonical free realizations for delay differential systems with incommensurable delays ⋮ Invertibility of linear systems described by differential-difference equations ⋮ Canonical free realizations for delay differential systems with incommensurable delays ⋮ Unnamed Item ⋮ Hereditary realizations of linear neutral delay-differential systems ⋮ Adaptive pole positioning in MIMO linear systems by periodic multirate-input controllers ⋮ Detectability of linear systems over a principal ideal domain with unknown inputs

Cites Work

• Unnamed Item
• Unnamed Item
• Ring models for delay-differential systems
• About Euclidean rings
• On first-order equations for multidimensional filters
• On an algebraic theory of systems defined by convolution operators
• Realization and stabilization of 2-d systems
• Separability of 2-D transfer matrices
• Recursive Identification of Linear Systems
• Algebraic Structure of Linear Dynamical Systems. III. Realization Theory Over a Commutative Ring

This page was built for publication: Realization algorithms for systems over a principal ideal domain