Greatest common divisor via generalized Sylvester and Bezout matrices
From MaRDI portal
Publication:4171907
DOI10.1109/TAC.1978.1101890zbMath0389.93008OpenAlexW2055039533MaRDI QIDQ4171907
Sun-Yuan Kung, Bitmead, Robert R., Brian D. O. Anderson, Thomas Kailath
Publication date: 1978
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.1978.1101890
Factorization of matrices (15A23) Canonical structure (93B10) Minimal systems representations (93B20) Canonical forms, reductions, classification (15A21)
Related Items
Common multiples and common divisors of matrix polynomials, II. Vandermonde and resultant matrices, Generic pole assignment using dynamic output feedback†, Generalized Bezoutian and the inversion problem for block matrices, I. General scheme, The theory of V-Bézoutians and its applications, Bezout operators for analytic operator functions. I: A general concept of Bezout operator, Generalized Bézoutian and matrix equations, Resultant operators and the Bezout equation for analytic matrix functions. I, A subspace method for the computation of the GCD of polynomials, On a class of entire matrix function equations, Invariance properties, and characterization of the greatest common divisor of a set of polynomials, Inertia theorems for matrix polynomials, On the quasi-stability criteria of monic matrix polynomials, Revisiting the Matrix Polynomial Greatest Common Divisor, The Sylvester resultant with applications to systems over rings, Asymptotically fast solution of Toeplitz and related systems of linear equations, Fast projection methods for minimal design problems in linear system theory, A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials, Congenial matrices, Novel theory for polynomial and rational matrices at infinity. Part1. Polynomial matrices, Bézoutians of rational matrix functions, matrix equations and factorizations, Normal forms for general polynomial matrices, Robustness and perturbations of minimal bases. II: The case with given row degrees, Robustness and perturbations of minimal bases, Spectrum separation and inertia for operator polynomials, Numerical computation of minimal polynomial bases: a generalized resultant approach, Efficient parallel factorization and solution of structured and unstructured linear systems, Greatest common divisor of matrices one of which is a disappear matrix, Bézout and Hankel matrices associated with row reduced matrix polynomials, Barnett type formulas, Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control, Finite settling time stabilisation for multivariable discrete-time systems: a polynomial equation approach, Common eigenvalues, divisors, and multiples of matrix polynomials: A review, On rank and null space computation of the generalized Sylvester matrix, Stabilisation of matrix polynomials, Greatest common divisors from generalized sylvester resultant matrices, An improved Toeplitz algorithm for polynomial matrix null-space computation, Methods of invariant analysis for linear control systems., On the solution space of discrete time AR-representations over a finite time horizon, The bezoutian, the Hankel matrix, output feedback and system eigenstructure, The Bezoutian and the eigenvalue-separation problem for matrix polynomials, Problems of control and information theory (Hungary), Robust estimation of GCD with sparse coefficients, Nearest common root of a set of polynomials: a structured singular value approach, Some generic invariant factor assignment results using dynamc output feedback, A matrix Euclidean algorithm induced by state space realization, Symmetric factorizations and localization of zeroes of rational matrix functions, Structural controllability and matrix nets†, Bezoutian and Schur-Cohn problem for operator polynomials, Factored forms for solutions of \(AX-XB=C\) and \(X-AXB=C\) in companion matrices, On minimal degree simultaneous pole assignment problems
