Krylov Subspace Methods in Dynamical Sampling

被引:0
|
作者
Akram Aldroubi
Ilya Krishtal
机构
[1] Vanderbilt University,Department of Mathematics
[2] Northern Illinois University,Department of Mathematical Sciences
来源
关键词
Distributed sampling; reconstruction; channel estimation; spectral estimation; Primary 94A20; 94A12; 42C15; 15A29;
D O I
10.1007/BF03549595
中图分类号
学科分类号
摘要
Let B be an unknown linear evolution process on ℂd ≃ ℓ2 (ℤd) driving an unknown initial state x and producing the states {Bℓx, ℓ = 0,1,…} at different time levels. The problem under consideration in this paper is to find as much information as possible about B and x from the measurements Y = {x(i), Bx(i), …, Bℓix(i) : i ∈ Ω ⊂ ℤd}. If B is a “low-pass” convolution operator, we show that we can recover both B and x, almost surely, as long as a sufficient number of temporal samples is used. For a general operator B, we can recover parts or even all of its spectrum from Y. As a special case of our method, we derive the centuries old Prony method which recovers a vector with an s-sparse Fourier transform from 2s of its consecutive components.
引用
收藏
页码:9 / 20
页数:11
相关论文
共 50 条