اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFrame completions with prescribed norms: local minimizers and applications
108
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let $mathcal F_0={f_i}_{iinmathbb{I}_{n_0}}$ be a finite sequence of vectors in $mathbb C^d$ and let $mathbf{a}=(a_i)_{iinmathbb{I}_k}$ be a finite sequence of positive numbers. We consider the completions of $cal F_0$ of the form $cal F=(cal F_0,cal G)$ obtained by appending a sequence $cal G={g_i}_{iinmathbb{I}_k}$ of vectors in $mathbb C^d$ such that $|g_i|^2=a_i$ for $iinmathbb{I}_k$, and endow the set of completions with the metric $d(cal F,tilde {mathcal F}) =max{ ,|g_i-tilde g_i|: iinmathbb{I}_k}$ where $tilde {cal F}=(cal F_0,,tilde {cal G})$. In this context we show that local minimizers on the set of completions of a convex potential $text{P}_varphi$, induced by a strictly convex function $varphi$, are also global minimizers. In case that $varphi(x)=x^2$ then $text{P}_varphi$ is the so-called frame potential introduced by Benedetto and Fickus, and our work generalizes several well known results for this potential. We show that there is an intimate connection between frame completion problems with prescribed norms and frame operator distance (FOD) problems. We use this connection and our results to settle in the affirmative a generalized version of Strawns conjecture on the FOD.
قيم البحث
اقرأ أيضاً
Given a finite sequence of vectors $mathcal F_0$ in $C^d$ we characterize in a complete and explicit way the optimal completions of $mathcal F_0$ obtained by adding a finite sequence of vectors with prescribed norms, where optimality is measured with
respect to majorization (of the eigenvalues of the frame operators of the completed sequence). Indeed, we construct (in terms of a fast algorithm) a vector - that depends on the eigenvalues of the frame operator of the initial sequence $cF_0$ and the sequence of prescribed norms - that is a minimum for majorization among all eigenvalues of frame operators of completions with prescribed norms. Then, using the eigenspaces of the frame operator of the initial sequence $cF_0$ we describe the frame operators of all optimal completions for majorization. Hence, the concrete optimal completions with prescribed norms can be obtained using recent algorithmic constructions related with the Schur-Horn theorem. The well known relation between majorization and tracial inequalities with respect to convex functions allow to describe our results in the following equivalent way: given a finite sequence of vectors $mathcal F_0$ in $C^d$ we show that the completions with prescribed norms that minimize the convex potential induced by a strictly convex function are structural minimizers, in the sense that they do not depend on the particular choice of the convex potential.
Given a finite sequence of vectors $mathcal F_0$ in $C^d$ we describe the spectral and geometrical structure of optimal completions of $mathcal F_0$ obtained by adding a finite sequence of vectors with prescribed norms, where optimality is measured w
ith respect to a general convex potential. In particular, our analysis includes the so-called Mean Square Error (MSE) and the Benedetto-Fickus frame potential. On a first step, we reduce the problem of finding the optimal completions to the computation of the minimum of a convex function in a convex compact polytope in $R^d$. As a second step, we show that there exists a finite set (that can be explicitly computed in terms of a finite step algorithm that depends on $cF_0$ and the sequence of prescribed norms) such that the optimal frame completions with respect to a given convex potential can be described in terms of a distinguished element of this set. As a byproduct we characterize the cases of equality in Lindskiis inequality from matrix theory.
In this paper we consider two problems in frame theory. On the one hand, given a set of vectors $mathcal F$ we describe the spectral and geometrical structure of optimal completions of $mathcal F$ by a finite family of vectors with prescribed norms,
where optimality is measured with respect to majorization. In particular, these optimal completions are the minimizers of a family of convex functionals that include the mean square error and the Bendetto-Fickus frame potential. On the other hand, given a fixed frame $mathcal F$ we describe explicitly the spectral and geometrical structure of optimal frames $mathcal G$ that are in duality with $mathcal F$ and such that the Frobenius norms of their analysis operators is bounded from below by a fixed constant. In this case, optimality is measured with respect to submajorization of the frames operators. Our approach relies on the description of the spectral and geometrical structure of matrices that minimize submajorization on sets that are naturally associated with the problems above.
We study the distribution of extensions of a number field $k$ with fixed abelian Galois group $G$, from which a given finite set of elements of $k$ are norms. In particular, we show the existence of such extensions. Along the way, we show that the Ha
sse norm principle holds for $100%$ of $G$-extensions of $k$, when ordered by conductor. The appendix contains an alternative purely geometric proof of our existence result.
For a collection of $N$ unit vectors $mathbf{X}={x_i}_{i=1}^N$, define the $p$-frame energy of $mathbf{X}$ as the quantity $sum_{i eq j} |langle x_i,x_j rangle|^p$. In this paper, we connect the problem of minimizing this value to another optimizatio
n problem, so giving new lower bounds for such energies. In particular, for $p<2$, we prove that this energy is at least $2(N-d) p^{-frac p 2} (2-p)^{frac {p-2} 2}$ which is sharp for $dleq Nleq 2d$ and $p=1$. We prove that for $1leq m<d$, a repeated orthonormal basis construction of $N=d+m$ vectors minimizes the energy over an interval, $pin[1,p_m]$, and demonstrate an analogous result for all $N$ in the case $d=2$. Finally, in connection, we give conjectures on these and other energies.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
