Computing the state difference equations for discrete overdetermined linear \(m \operatorname{D}\) systems
From MaRDI portal
Publication:899299
DOI10.1016/j.automatica.2015.11.019zbMath1328.93073OpenAlexW2194610241MaRDI QIDQ899299
Publication date: 23 December 2015
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2015.11.019
Discrete-time control/observation systems (93C55) Linear systems in control theory (93C05) Algebraic methods (93B25)
Related Items
Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm, Multidimensional realisation theory and polynomial system solving
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the null spaces of the Macaulay matrix
- The discrete multidimensional MPUM
- Approximate computation of zero-dimensional polynomial ideals
- Time-invariant descriptor systems
- Computing ideals of points
- Pole-zero representation of descriptor systems
- Efficiency improvement in an \(n\)D systems approach to polynomial optimization
- The singular general model of 2D systems and its solution
- A discrete state-space model for linear image processing
- State-space realization theory of two-dimensional filters
- State Space Realization of 2-D Finite-Dimensional Behaviours
- Using Algebraic Geometry
- The general state-space model for a two-dimensional linear digital system
- Generalization of Cayley-Hamilton theorem for n-D polynomial matrices
- The Geometry of Multivariate Polynomial Division and Elimination
- Gröbner bases and systems theory