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

DOI10.1016/J.CAM.2021.113499zbMATH Open1461.93237arXiv1907.13101OpenAlexW3131210283MaRDI QIDQ2020558FDOQ2020558

Ivan Markovsky, Antonio Fazzi, Nicola Guglielmi

Publication date: 23 April 2021

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

Abstract: Computation of (approximate) polynomials common factors is an important problem in several fields of science, like control theory and signal processing. While the problem has been widely studied for scalar polynomials, the scientific literature in the framework of matrix polynomials seems to be limited to the problem of exact greatest common divisors computation. In this paper, we generalize two algorithms from scalar to matrix polynomials. The first one is fast and simple. The second one is more accurate but computationally more expensive. We test the performances of the two algorithms and observe similar behavior to the one in the scalar case. Finally we describe an application to multi-input multi-output linear time-invariant dynamical systems.

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

Recommendations

• Structured matrix based methods for approximate polynomial GCD
• The approximate GCD of inexact polynomials
• A fast algorithm for approximate polynomial gcd based on structured matrix computations
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• scientific article; zbMATH DE number 40793
• GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
• Structured total least norm and approximate GCDs of inexact polynomials
• Structured matrix-based methods for polynomial \(\varepsilon\)-gcd: analysis and comparisons
• Approximation of matrices and a family of Gander methods for polar decomposition
• scientific article; zbMATH DE number 916414

zbMATH Keywords

matrix polynomialssubspace methodmatrix ODEsapproximate common factor

Mathematics Subject Classification ID

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

Cites Work

• Linear multivariable systems
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matrix Polynomials
• From time series to linear system. I: Finite dimensional linear time invariant systems
• Exact and Approximate Modeling of Linear Systems
• The Behavioral Approach to Open and Interconnected Systems
• The resultant for regular matrix polynomials and quasi commutativity
• A subspace method for the computation of the GCD of polynomials
• 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
• The Resultant Matrix and its Generalizations. I. The Resultant Operator for Matrix Polynomials
• Quasi Commutativity of Regular Matrix Polynomials: Resultant and Bezoutian
• 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
• An algorithm for coprime matrix fraction description using Sylvester matrices
• Non-fragile asynchronous \(H_{\infty}\) control for uncertain stochastic memory systems with Bernoulli distribution
• Title not available (Why is that?)
• An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility

Cited In (6)

• Distributed identification based partially-coupled recursive generalized extended least squares algorithm for multivariate input-output-error systems with colored noises from observation data
• Revisiting the Matrix Polynomial Greatest Common Divisor
• Structured low-rank approximation for nonlinear matrices
• Auxiliary model-based hierarchical stochastic gradient methods for multiple-input multiple-output systems
• Distance problems in the behavioral setting
• Implementation improvements and extensions of an ODE-based algorithm for structured low-rank approximation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020558)