Best multi-valued approximants via multi-designs

Abstract

Let d =(dj)j∈Im∈ Nm be a decreasing finite sequence of positive integers, and let α=(αi)i∈In be a finite and non-increasing sequence of positive weights. Given a family 0=(Fj0)j∈Im of Bessel sequences with Fj0=\fi,j0\i∈ Ik∈ (Cdj)k for each 1≤ j≤ m, our main purpose on this work is to characterize the best approximants of the m-tuple of frame operators of the elements of 0 in the set D(α, d) of the so-called (α, d)-designs, which are the m-tuples =(Fj)j∈Im such that each Fj=\fi,j\i∈In is a finite sequence in Cdj, and Σj∈Im\|fi,j\|2=αi for i∈In. Specifically, in this work we completely characterize the minimizers of the Joint Frame Operator Distance (JFOD) function: :D(α, d) R≥ 0 given by ()=Σj=1m \| SFj - SF0j\|22 \,, where SF denotes the frame operator of F and \|·\|2 is the Frobenius norm. Indeed, we show that local minimizers of are also global and we obtain an algorithm to construct the optimal (α, d)-desings. As an application of the main result, in the particular case that m=1, we also characterize global minimizers of a G-frames problem recently considered by He, Leng and Xu.

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…