A matrix Euclidean algorithm induced by state space realization
From MaRDI portal
Recommendations
- Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
- A new view on the numerical computation of the greatest common divisor of two polynomials.
- Revisiting the Matrix Polynomial Greatest Common Divisor
- A matrix Euclidean algorithm and matrix continued fraction expansions
Cites work
- A controllability test for general first-order representations
- A matrix Euclidean algorithm and matrix continued fraction expansions
- Errata to: Two-sided tangential interpolation of real rational matrix functions
- Fast projection methods for minimal design problems in linear system theory
- Greatest common divisor via generalized Sylvester and Bezout matrices
- Homogeneous behaviors
- scientific article; zbMATH DE number 3839766 (Why is no real title available?)
- scientific article; zbMATH DE number 47820 (Why is no real title available?)
- scientific article; zbMATH DE number 721804 (Why is no real title available?)
- Linear multivariable systems
- 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
- Realization by inspection
- Some Applications of Matrics in the Theory of Equations
Cited in
(5)- Generalized matrix Euclidean algorithms for solving diophantine equations and associated problems
- Partial realization and the Euclidean algorithm
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
- scientific article; zbMATH DE number 1860711 (Why is no real title available?)
- A matrix Euclidean algorithm and matrix continued fraction expansions
This page was built for publication: A matrix Euclidean algorithm induced by state space realization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1300871)