arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.6962astro-ph.HEastro-ph.IM
收藏

固定计算预算下优化的脉冲星盲Gamma-ray搜索

Optimized Blind Gamma-ray Pulsar Searches at Fixed Computing Budget

Holger J. Pletsch, Colin J. Clark

摘要:

在费米LAT的多年光子数据中进行盲伽马射线脉冲星搜索的灵敏度主要受到有限计算资源的限制。为了解决这个“大海捞针”的问题,我们在这里提出了优化盲搜索的方法,以达到最高的灵敏度在固定的计算成本。对于相干和半相干的方法,我们考虑他们的统计特性,并研究其搜索灵敏度下的计算约束。结果验证了多级策略,其中第一阶段使用有效的半相干方法扫描整个参数空间,然后通过完全相干的分析来细化有希望的候选者。我们还发现,对于第一阶段的盲目搜索不相干谐波求和的权力是不值得在固定的计算成本为典型的伽玛射线散射。进一步提高灵敏度,我们提出了效率提高插值技术的半相干搜索阶段。通过现实的模拟,我们表明,总体上这些优化可以显着降低最小可检测的脉冲分数几乎50%,在相同的计算费用。

英文摘要:

The sensitivity of blind gamma-ray pulsar searches in multiple years worth of photon data, as from the Fermi LAT, is primarily limited by the finite computational resources available. Addressing this "needle in a haystack" problem, we here present methods for optimizing blind searches to achieve the highest sensitivity at fixed computing cost. For both coherent and semicoherent methods, we consider their statistical properties and study their search sensitivity under computational constraints. The results validate a multistage strategy, where the first stage scans the entire parameter space using an efficient semicoherent method and promising candidates are then refined through a fully coherent analysis. We also find that for the first stage of a blind search incoherent harmonic summing of powers is not worthwhile at fixed computing cost for typical gamma-ray pulsars. Further enhancing sensitivity, we present efficiency-improved interpolation techniques for the semicoherent search stage. Via realistic simulations we demonstrate that overall these optimizations can significantly lower the minimum detectable pulsed fraction by almost 50% at the same computational expense.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑