Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
DOI10.1016/j.laa.2020.12.034zbMath1464.65041OpenAlexW3121051690MaRDI QIDQ2656632
Publication date: 16 March 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.12.034
block Toeplitz matrixstructured low-rank approximationresultant matrixleft prime polynomial matrixradius of primenessright minimal indices
Numerical computation of matrix norms, conditioning, scaling (65F35) Toeplitz, Cauchy, and related matrices (15B05) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A quadratically convergent algorithm for structured low-rank approximation
- Spectral equivalence of matrix polynomials and the index sum theorem
- Computing the radius of controllability for state space systems
- An improved Toeplitz algorithm for polynomial matrix null-space computation
- Where is the nearest non-regular pencil?
- Fast projection methods for minimal design problems in linear system theory
- On approximate GCDs of univariate polynomials
- A subspace method for the computation of the GCD of polynomials
- Uniform probability and natural density of mutually left coprime polynomial matrices over finite fields
- Structured low rank approximation
- Robustness and perturbations of minimal bases
- Computing nearby non-trivial Smith forms
- Computing lower rank approximations of matrix polynomials
- Approximate gcds of polynomials and sparse SOS relaxations
- Optimization challenges in the structured low rank approximation problem
- Structured low-rank approximation and its applications
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- Structured total least norm and approximate GCDs of inexact polynomials
- Numerical computation of minimal polynomial bases: a generalized resultant approach
- Computing GCRDs of approximate differential polynomials
- Structured Low-Rank Approximation with Missing Data
- Factorization Approach to Structured Low-Rank Approximation with Applications
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- Some relations satisfied by prime polynomial matrices and their role in linear multivariable system theory
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Total Least Norm Formulation and Solution for Structured Problems
- Computing the Nearest Rank-Deficient Matrix Polynomial
- Computing the rank and a small nullspace basis of a polynomial matrix
- Matrix Polynomials
- On the Nearest Singular Matrix Pencil
- A minimal polynomial basis solution to residual generation for fault diagnosis in linear systems
This page was built for publication: Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach