A matrix Euclidean algorithm induced by state space realization
From MaRDI portal
Publication:1300871
DOI10.1016/S0024-3795(98)10186-6zbMath0963.93025OpenAlexW1974135362MaRDI QIDQ1300871
Brian M. Allen, Joachim Rosenthal
Publication date: 8 May 2000
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0024-3795(98)10186-6
polynomial matricesEuclidean algorithmcoding theoryconvolutional encoderminimal state space realizationgreatest common left divisorirreducible matrix fraction descriptions
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast projection methods for minimal design problems in linear system theory
- Linear multivariable systems
- Errata to: Two-sided tangential interpolation of real rational matrix functions
- A controllability test for general first-order representations
- Homogeneous behaviors
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- On recursiveness and related topics in linear systems
- Paradigms and puzzles in the theory of dynamical systems
- Greatest common divisor via generalized Sylvester and Bezout matrices
- Realization by inspection
- Some Applications of Matrics in the Theory of Equations
- A matrix Euclidean algorithm and matrix continued fraction expansions
This page was built for publication: A matrix Euclidean algorithm induced by state space realization
