线性算子的压缩识别
Compressive Identification of Linear Operators
摘要:
我们考虑的问题,确定一个线性的确定性运营商的输入输出测量。对于大类连续(因此有界)的运营商,在额外的温和的限制,我们表明,稳定的可识别性是可能的,如果运营商的扩展函数的总支持区满足D <= 1/2。该结果适用于扩展函数的任意(可能是碎片化的)支持区域,不对支持区域的总范围施加限制,并且最重要的是,不需要在识别之前已知扩展函数的支持区域。进一步证明了只要要求几乎所有算子的可识别性,当D <= 1时,稳定可识别性是可能的。这个结果是令人惊讶的,因为它表明在识别之前不知道扩展函数的支持区域没有惩罚。
英文摘要:
We consider the problem of identifying a linear deterministic operator from an input-output measurement. For the large class of continuous (and hence bounded) operators, under additional mild restrictions, we show that stable identifiability is possible if the total support area of the operator's spreading function satisfies D <= 1/2. This result holds for arbitrary (possibly fragmented) support regions of the spreading function, does not impose limitations on the total extent of the support region, and, most importantly, does not require the support region of the spreading function to be known prior to identification. Furthermore, we prove that asking for identifiability of only almost all operators, stable identifiability is possible if D <= 1. This result is surprising as it says that there is no penalty for not knowing the support region of the spreading function prior to identification.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。