A minimal realization algorithm for matrix sequences
From MaRDI portal
Cited in
(17)- On the partial realization problem
- Partial realization of symmetric matrix rational functions
- Kernel structure of block Hankel and Toeplitz matrices and partial realization
- A method of constructing minimal approximate realizations of linear input-output behavior
- An algorithm for constructing a minimal partial realization in the multivariable case
- A canonical matrix continued fraction solution of the minimal (partial) realization problem
- Linear feedback shift registers and the minimal realization problem
- A fraction free matrix Berlekamp/Massey algorithm
- A Lattice-Based Minimal Partial Realization Algorithm
- A realization approach to stochastic model reduction
- Minimal realization of linear systems
- The ε-algorithm and η-algorithm for generalized inverse rectangular matrix pade approximants
- On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)
- On parametrizations for the minimal partial realization problem
- A lattice-based minimal partial realization algorithm for matrix sequences of varying length
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- Minimal vector Padé approximation
This page was built for publication: A minimal realization algorithm for matrix sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4404727)