Pages that link to "Item:Q4171907"

The following pages link to Greatest common divisor via generalized Sylvester and Bezout matrices (Q4171907):

Displaying 35 items.

• Common eigenvalues, divisors, and multiples of matrix polynomials: A review (Q581499) (← links)
• Factored forms for solutions of \(AX-XB=C\) and \(X-AXB=C\) in companion matrices (Q800987) (← links)
• An improved Toeplitz algorithm for polynomial matrix null-space computation (Q1004243) (← links)
• Robust estimation of GCD with sparse coefficients (Q1046678) (← links)
• Some generic invariant factor assignment results using dynamc output feedback (Q1051595) (← links)
• Bezoutian and Schur-Cohn problem for operator polynomials (Q1059828) (← links)
• Generalized Bezoutian and the inversion problem for block matrices, I. General scheme (Q1088139) (← links)
• Generalized Bézoutian and matrix equations (Q1097329) (← links)
• Resultant operators and the Bezout equation for analytic matrix functions. I (Q1105169) (← links)
• Asymptotically fast solution of Toeplitz and related systems of linear equations (Q1151720) (← links)
• Fast projection methods for minimal design problems in linear system theory (Q1151859) (← links)
• Congenial matrices (Q1161580) (← links)
• Spectrum separation and inertia for operator polynomials (Q1206895) (← links)
• Methods of invariant analysis for linear control systems. (Q1270540) (← links)
• A matrix Euclidean algorithm induced by state space realization (Q1300871) (← links)
• The theory of V-Bézoutians and its applications (Q1344077) (← links)
• A subspace method for the computation of the GCD of polynomials (Q1361353) (← links)
• On minimal degree simultaneous pole assignment problems (Q1611912) (← links)
• On the solution space of discrete time AR-representations over a finite time horizon (Q1826816) (← links)
• The Bezoutian and the eigenvalue-separation problem for matrix polynomials (Q1836137) (← links)
• Bezout operators for analytic operator functions. I: A general concept of Bezout operator (Q1891846) (← links)
• Bézoutians of rational matrix functions, matrix equations and factorizations (Q1970435) (← links)
• Robustness and perturbations of minimal bases. II: The case with given row degrees (Q2002564) (← links)
• Robustness and perturbations of minimal bases (Q2002782) (← links)
• Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control (Q2020558) (← links)
• Greatest common divisor of matrices one of which is a disappear matrix (Q2260814) (← links)
• Nearest common root of a set of polynomials: a structured singular value approach (Q2332430) (← links)
• Normal forms for general polynomial matrices (Q2457359) (← links)
• Numerical computation of minimal polynomial bases: a generalized resultant approach (Q2484243) (← links)
• Efficient parallel factorization and solution of structured and unstructured linear systems (Q2486566) (← links)
• On a class of entire matrix function equations (Q2644062) (← links)
• Stabilisation of matrix polynomials (Q2799226) (← links)
• Symmetric factorizations and localization of zeroes of rational matrix functions (Q3124874) (← links)
• On the quasi-stability criteria of monic matrix polynomials (Q6056235) (← links)
• Revisiting the Matrix Polynomial Greatest Common Divisor (Q6116668) (← links)