Tight frame completions with prescribed norms

Details Tight frame completions with prescribed norms Tight frame completions with prescribed norms

2006-06-13

arxiv.org/abs/math/0606319v1

Mathematics

Functional Analysis

Scientific paper

Let $\hil$ be a finite dimensional (real or complex) Hilbert space and let $\{a_i\}_{i=1}^\infty$ 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\in \NN\cup\{\infty\}$ and a Bessel sequence $\g$ in $\hil$ such that $\cF\cup\cG$ is a tight frame for $\hil$ and $\|g_i\|^2=a_i$ for $1\leq i\leq r$. Moreover, in this case we compute the minimum $r\in \NN\cup\{\infty\}$ 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$.

Affiliated with

Also associated with

No associations

Rating

Tight frame completions with prescribed norms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tight frame completions with prescribed norms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tight frame completions with prescribed norms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-197147