A matrix Euclidean algorithm and matrix continued fraction expansions

DOI10.1016/0167-6911(83)90025-7zbMath0545.93013OpenAlexW2004337199MaRDI QIDQ5896423

Paul A. Fuhrmann

Publication date: 1983

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6911(83)90025-7

zbMATH Keywords

reductionEuclidean algorithmcontinued fraction expansionoutput injectionpartial realizations

Mathematics Subject Classification ID

Minimal systems representations (93B20) Polynomials in real and complex fields: factorization (12D05) Algebraic methods (93B25) Continued fractions (11A55) Realizations from input-output data (93B15) Convergence and divergence of continued fractions (40A15)

Related Items (1)

An algebraic approach to the partial realization problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Certain continued fractions associated with the Padé table
• Expansion of power series into \(P\)-fractions
• On the partial realization problem
• Factorization indices at infinity for rational matrix functions
• Algebraic system theory: An analyst's point of view
• Nonsingular Factors of Polynomial Matrices and $(A,B)$-Invariant Subspaces
• A Polynomial Characterization of $(\mathcal{A},\mathcal{B})$-Invariant and Reachability Subspaces
• Linear feedback via polynomial models
• Duality in polynomial models with some applications to geometric control theory
• Further results on polynomial characterizations of (<tex>F, G</tex>)-invariant and reachability subspaces
• A study of (A, B) invariant subspaces via polynomial models
• On strict system equivalence and similarity†
• Linear Feedback—An Algebraic Approach
• Simulation of linear systems and factorization of matrix polynomials†

This page was built for publication: A matrix Euclidean algorithm and matrix continued fraction expansions