首页> 外文会议>International Conference on Sampling Theory and Applications >Sampling solutions of Schro¨dinger equations on combinatorial graphs
【24h】

Sampling solutions of Schro¨dinger equations on combinatorial graphs

机译:组合图施拉德方程的采样解决方案

获取原文

摘要

We consider functions on a graph G whose evolution in time - ∞ <; t <; ∞ is governed by a Schro?dinger type equation with a combinatorial Laplace operator on the right side. For a given subset S of vertices of G we compute a cut-off frequency ω > 0 such that solutions to a Cauchy problem with initial data in PW (G) are completely determined by their samples on S x {kπ /ω}, where k ε N. It is shown that in the case of a bipartite graph our results are sharp.
机译:我们考虑在图表g上的函数,其演变时间 - ∞<; T <; ∞由施施加的施法型式等式,右侧带有组合拉普拉斯镜操作员。对于G的顶点的给定子集S计算截止频率ω> 0,使得对PW(G)中的初始数据的Cauchy问题的解决方案完全由S X {Kπ/ω}上的样本确定,其中kεn.显示在二分钟的情况下,我们的结果是尖锐的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号