Almost everywhere injectivity conditions for the matrix recovery problem
نویسندگان
چکیده
The aim of matrix recovery is to recover P ∈ M ⊂ F p × q from L A ( ) = Tr 1 T , 2 … N with j V which raised in many areas. In this paper, we build up a framework for almost everywhere means injectivity on . We mainly focus the following question: how measurements are needed all matrices ? For case where both and algebraic varieties, use tools geometry study question present some results address it under different settings.
منابع مشابه
Almost Everywhere Matrix Recovery
Matrix recovery is raised in many areas. In this paper, we build up a framework for almost everywhere matrix recovery which means to recover almost all the P ∈ M ⊂ F from Tr(AjP ), j = 1, . . . , N where Aj ∈ Vj ⊂ F. We mainly focus on the following question: how many measurements are needed to recover almost all the matrices in M? For the case where both M and Vj are algebraic varieties, we us...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولIncentive Compatibility: Everywhere vs. Almost Everywhere∗
A risk neutral buyer observes a private signal s ∈ [a, b], which informs her that the mean and variance of a normally distributed risky asset are s and σ s respectively. She then sets a price at which to acquire the asset owned by risk averse “outsiders”. Assume σ s ∈ { 0, σ } for some σ > 0 and let B = { s ∈ [a, b] | σ s = 0 } . If B = ∅, then there exists a fully revealing equilibrium in whic...
متن کاملAlmost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network has very large connectivity — in fact, , where is the number of potential corruptions in the network. This impossibility result renders existing MPC results far less applicable in practice, since many deployed network...
متن کاملAlmost everywhere domination
A Turing degree a is said to be almost everywhere dominating if, for almost all X ∈ 2 with respect to the “fair coin” probability measure on 2, and for all g : ω → ω Turing reducible to X, there exists f : ω → ω of Turing degree a which dominates g. We study the problem of characterizing the almost everywhere dominating Turing degrees and other, similarly defined classes of Turing degrees. We r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2021
ISSN: ['1096-603X', '1063-5203']
DOI: https://doi.org/10.1016/j.acha.2019.09.002