Krylov subspace methods in dynamical sampling

From MaRDI portal
Publication:4609549




Abstract: Let B be an unknown linear evolution process on mathbbCdsimeql2(mathbbZd) driving an unknown initial state x and producing the states Bellx,ell=0,1,ldots 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 , Bx(i), dots, . If B is a "low-pass" convolution operator, we show that we can recover both B and x, almost surely, as long as we double the amount of temporal samples needed in cite{ADK13} to recover the signal propagated by a known operator B. 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's method cite{BDVMC08, P795, PP13} which recovers a vector with an s-sparse Fourier transform from 2s of its consecutive components.









This page was built for publication: Krylov subspace methods in dynamical sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4609549)