Pith. sign in

REVIEW

Tight frame completions with prescribed norms

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0606319 v1 pith:APWLYFLY submitted 2006-06-13 math.FA

classification math.FA
keywords sequencefiniteinftytightframenumbersalgorithmicbessel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

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$.

Discussion (0). Sign in to comment.

Pith tools