Tight frame completions with prescribed norms

Abstract

Let 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 in we find necessary and sufficient conditions for the existence of r∈ \∞\ and a Bessel sequence in such that is a tight frame for and \|gi\|2=ai for 1≤ i≤ r. Moreover, in this case we compute the minimum r∈ \∞\ 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 .

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…