Prony方程组解的误差放大几何
Geometry of error amplification in solving Prony system with near-colliding nodes
摘要:
我们考虑一个重建问题的“尖峰列车”信号$F$的先验已知的形式$F(x)=\sum_{j=1}^{d}a_{j}δ\left(x-x_{j}\right),$从他们的时刻$m_k(F)=\int x^kF(x)dx.$。我们假设时刻$m_k(F)$,$k=0,1,\ldots,2d-1$,是已知的绝对误差不超过$ε> 0$。这个问题本质上等同于解决Prony系统$\sum_{j=1}^d a_jx_j^k=m_k(F), \ k=0,1,\ldots,2d-1.$。我们研究了在节点$x_1,\ldots,x_d$接近碰撞的情况下,即形成大小为$h \ll 1$的簇,从$m_k(F),$重建$F$中的“误差放大几何”。我们表明,在这种情况下,误差放大是由某些代数品种的信号$F$,我们称之为“Prony品种”的参数空间。在此基础上,我们产生的下限和上限,相同的顺序,在最坏的情况下重建误差。此外,我们得到单独的下限和上限的振幅和节点的重建。最后,我们讨论了如何使用的几何形状的Prony品种,以提高重建精度的额外的先验信息。
英文摘要:
We consider a reconstruction problem for ``spike-train'' signals $F$ of an a priori known form $F(x)=\sum_{j=1}^{d}a_{j}δ\left(x-x_{j}\right),$ from their moments $m_k(F)=\int x^kF(x)dx.$ We assume that the moments $m_k(F)$, $k=0,1,\ldots,2d-1$, are known with an absolute error not exceeding $ε> 0$. This problem is essentially equivalent to solving the Prony system $\sum_{j=1}^d a_jx_j^k=m_k(F), \ k=0,1,\ldots,2d-1.$ We study the ``geometry of error amplification'' in reconstruction of $F$ from $m_k(F),$ in situations where the nodes $x_1,\ldots,x_d$ near-collide, i.e. form a cluster of size $h \ll 1$. We show that in this case, error amplification is governed by certain algebraic varieties in the parameter space of signals $F$, which we call the ``Prony varieties''. Based on this we produce lower and upper bounds, of the same order, on the worst case reconstruction error. In addition we derive separate lower and upper bounds on the reconstruction of the amplitudes and the nodes. Finally we discuss how to use the geometry of the Prony varieties to improve the reconstruction accuracy given additional a priori information.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。