Abstract
A canonical form for AR 2-D systems representations is introduced. This yields a method for computing the system trajectories by means of a line-by-line recursion, and displays some relevant information about the system structure such as the choice of inputs and initial conditions.
Similar content being viewed by others
References
Buchberger, B.: “Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory,” in N.K. Bose (ed.),Multidimensional Systems Theory, pp. 184–232, D. Reidel, 1985.
Rocha, P. and J.C. Willems: “State for 2-D system,”Linear Algebra and its Applications, vols. 122/123/124, pp. 1003–1038, 1989.
Willems, J.C.: “From Time Series to Linear System—Part I. Finite Dimensional Linear Time Invariant Systems”:Automatica Vol. 22, 5, pp. 561–568, 1986.
Willems, J.C.: “Models for Dynamics,”Dynamics Reported, vol. 2, pp. 171–269, 1989.
Author information
Authors and Affiliations
Additional information
Partly supported by the Calouste Gulbenkian Foundation, Portugal.
Rights and permissions
About this article
Cite this article
Rocha, P., Willems, J.C. Canonical computational forms for AR 2-D systems. Multidim Syst Sign Process 1, 251–278 (1990). https://doi.org/10.1007/BF01812400
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01812400