English

Procrustes problems and Parseval quasi-dual frames

Functional Analysis 2013-10-01 v1

Abstract

Parseval frames have particularly useful properties, and in some cases, they can be used to reconstruct signals which were analyzed by a non-Parseval frame. In this paper, we completely describe the degree to which such reconstruction is feasible. Indeed, notice that for fixed frames \cF\cF and \cX\cX with synthesis operators FF and XX, the operator norm of FXIFX^*-I measures the (normalized) worst-case error in the reconstruction of vectors when analyzed with \cX\cX and synthesized with \cF\cF. Hence, for any given frame \cF\cF, we compute explicitly the infimum of the operator norms of FXIFX^*-I, where \cX\cX is any Parseval frame. The \cX\cX's that minimize this quantity are called Parseval quasi-dual frames of \cF\cF. Our treatment considers both finite and infinite Parseval quasi-dual frames.

Keywords

Cite

@article{arxiv.1309.7914,
  title  = {Procrustes problems and Parseval quasi-dual frames},
  author = {G. Corach and P. Massey and M. Ruiz},
  journal= {arXiv preprint arXiv:1309.7914},
  year   = {2013}
}
R2 v1 2026-06-22T01:37:14.869Z