Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control

DOI10.1016/j.cam.2021.113499zbMath1461.93237arXiv1907.13101OpenAlexW3131210283MaRDI QIDQ2020558

Ivan Markovsky, Antonio Fazzi, Nicola Guglielmi

Publication date: 23 April 2021

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.13101

zbMATH Keywords

matrix polynomialssubspace methodmatrix ODEsapproximate common factor

Mathematics Subject Classification ID

Multivariable systems, multidimensional control systems (93C35) Control/observation systems governed by ordinary differential equations (93C15)

Related Items (3)

Distance problems in the behavioral setting ⋮ Structured low-rank approximation for nonlinear matrices ⋮ Revisiting the Matrix Polynomial Greatest Common Divisor

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• From time series to linear system. I: Finite dimensional linear time invariant systems
• Linear multivariable systems
• A subspace method for the computation of the GCD of polynomials
• An algorithm for coprime matrix fraction description using Sylvester matrices
• Non-fragile asynchronous \(H_{\infty}\) control for uncertain stochastic memory systems with Bernoulli distribution
• An ODE-based method for computing the approximate greatest common divisor of polynomials
• Polynomial solution to stabilization problem for multivariable sampled-data systems with time delay
• The Resultant Matrix and its Generalizations. I. The Resultant Operator for Matrix Polynomials
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• Exact and Approximate Modeling of Linear Systems
• Quasi Commutativity of Regular Matrix Polynomials: Resultant and Bezoutian
• The resultant for regular matrix polynomials and quasi commutativity
• Nonsingular Factors of Polynomial Matrices and $(A,B)$-Invariant Subspaces
• Generalized Bezoutian and Sylvester matrices in multivariable linear control
• Greatest common divisor via generalized Sylvester and Bezout matrices
• An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
• Matrix Polynomials
• The Behavioral Approach to Open and Interconnected Systems

This page was built for publication: Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control