vix.ing · top · new · best · stats · spec

Tight frame completions with prescribed norms

2006/06/13 by Massey, P., Ruiz, M.
#42C15 #FOS: Mathematics #Functional Analysis (math.FA)

paper · doi:10.48550/arxiv.math/0606319

Abstract

Let \hil be a finite dimensional (real or complex) Hilbert space and let \ai\i=1^∞ be a non-increasing sequence of positive numbers. Given a finite sequence of vectors \f in \hil we find necessary and sufficient conditions for the existence of r∈ \NN∪\∞\ and a Bessel sequence \g in \hil such that \cF∪\cG is a tight frame for \hil and ‖gi2=ai for 1≤ i≤ r. Moreover, in this case we compute the minimum r∈ \NN∪\∞\ with this property. Using recent results on the Schur-Horn theorem, we also obtain a not so optimal but algorithmic computable (in a finite numbers of steps) tight completion sequence \cG.

Related