Optimal completions of a frame

DOI10.1007/S10444-013-9339-7MaRDI QIDQ6233726arXivWikidataFDO

Authors P. G. Massey, Mariano A. Ruiz, Demetrio Stojanoff

Publication date 15 June 2012

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10444-013-9339-7

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) General harmonic expansions, frames (42C15)

arXiv classification

math.FA

Abstract: Given a finite sequence of vectors $mathcal{F}_0$ in $C^d$ we describe the spectral and geometrical structure of optimal completions of $mathcal{F}_0$ obtained by adding a finite sequence of vectors with prescribed norms, where optimality is measured with respect to a general convex potential. In particular, our analysis includes the so-called Mean Square Error (MSE) and the Benedetto-Fickus' frame potential. On a first step, we reduce the problem of finding the optimal completions to the computation of the minimum of a convex function in a convex compact polytope in $R^d$. As a second step, we show that there exists a finite set (that can be explicitly computed in terms of a finite step algorithm that depends on $c{F}_0$ and the sequence of prescribed norms) such that the optimal frame completions with respect to a given convex potential can be described in terms of a distinguished element of this set. As a byproduct we characterize the cases of equality in Lindskii's inequality from matrix theory.

This page was built for publication: Optimal completions of a frame

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