English

Blind deconvolution of covariance matrix inverses for autoregressive processes

Numerical Analysis 2020-06-09 v2 Numerical Analysis

Abstract

Matrix C\mathbf{C} can be blindly deconvoluted if there exist matrices A\mathbf{A} and B\mathbf{B} such that C=AB\mathbf{C}= \mathbf{A} \ast \mathbf{B}, where \ast denotes the operation of matrix convolution. We study the problem of matrix deconvolution in the case where matrix C\mathbf{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 pp, where we prove that the deconvolution C=AB\mathbf{C}= \mathbf{A} \ast \mathbf{B} does not exist if the matrix B\mathbf{B} is diagonal and its size is larger than pp.

Keywords

Cite

@article{arxiv.1909.07216,
  title  = {Blind deconvolution of covariance matrix inverses for autoregressive processes},
  author = {Nina Golyandina and Anatoly Zhigljavsky},
  journal= {arXiv preprint arXiv:1909.07216},
  year   = {2020}
}
R2 v1 2026-06-23T11:16:40.963Z