Matrix C can be blindly deconvoluted if there exist matrices A and B such that C=A⁎B, where ⁎ denotes the operation of matrix convolution. We study the problem of matrix deconvolution in the case where matrix C is proportional to the inverse of the autocovariance matrix of an autoregressive process. We show that the deconvolution of such matrices is important in problems of Hankel structured low-rank approximation (HSLRA). In the cases of autoregressive models of orders one and two, we fully characterize the range of parameters where such deconvolution can be performed and provide construction schemes for performing deconvolutions. We also consider general autoregressive models of order p, where we prove that the deconvolution C=A⁎B does not exist if the matrix B is diagonal and its size is larger than p.

Original languageEnglish
Pages (from-to)188-211
Number of pages24
JournalLinear Algebra and Its Applications
Volume593
DOIs
StatePublished - 15 May 2020

    Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Geometry and Topology
  • Numerical Analysis
  • Algebra and Number Theory

    Research areas

  • Autoregressive process, Correlated noise, Matrix convolution, Structured low-rank approximation, MODES, COLORED NOISE, DYNAMICS, MONTE-CARLO SSA, ALGORITHMS, OSCILLATIONS

ID: 51646149