论文标题
$ \ tt {kobesim} $:用于行星检测的贝叶斯观察策略算法在径向速度盲目搜索调查中
$\tt{KOBEsim}$: a Bayesian observing strategy algorithm for planet detection in radial velocity blind-search surveys
论文作者
论文摘要
在系外行星的随访和表征时代,地面观察时间是宝贵的,尤其是在高精度的径向速度仪器中。因此,盲目搜索径向速度调查需要专门的观察策略,以优化观察时间,这对于在大轨道时期检测小岩石世界尤其重要。我们开发了一种算法,目的是提高在系外行星搜索的背景下径向速度观察的效率,并将其应用于可居住的系外行星(Kobe)实验绕的K-dwarfs。我们旨在加快系外行星确认,或者,或者,尽早拒绝虚假信号,以节省望远镜时间并提高盲目搜索调查的效率和对过境候选者的随访。一旦达到了最小初始数量的径向速度数据点,以一种按照广义的lomb-scargle(GLS)期间图开始出现的方式,该周期以所提出的算法为目标,名为$ \ textttttt {kobesim} $。该算法选择了下一个观察日期,该日期与没有开普勒轨道的模型相比,最大化了贝叶斯证据的证据。通过模拟数据,我们证明该算法加速了外部球星的检测,需要$ 29-33 \,\%$少观测值和$ 41-47 \,\%$ $ s LIST PLOUTE DATASET的时间段($ M _ {$ m_ _ {\ rm p}与常规的单调节奏策略相比。 $ 20 \,m _ {\ oplus} $ Planets的数据点数的增强也很明显,$ 16 \,\%$。我们还测试了带有特定神户目标的实际数据的$ \ texttt {kobesim} $,对于已确认的行星$ HD〜102365 \,b $。他们俩都表明,该策略能够将检测加速至$ 2 $。
Ground-based observing time is precious in the era of exoplanet follow-up and characterization, especially in high-precision radial velocity instruments. Blind-search radial velocity surveys thus require a dedicated observational strategy in order to optimize the observing time, which is particularly crucial for the detection of small rocky worlds at large orbital periods. We develop an algorithm with the purpose of improving the efficiency of radial velocity observations in the context of exoplanet searches, and we apply it to the K-dwarfs Orbited By habitable Exoplanets (KOBE) experiment. We aim at accelerating exoplanet confirmations or, alternatively, rejecting false signals as early as possible in order to save telescope time and increase the efficiency of both blind-search surveys and follow-up of transiting candidates. Once a minimum initial number of radial velocity datapoints is reached in such a way that a periodicity starts to emerge according to generalized Lomb-Scargle (GLS) periodograms, that period is targeted with the proposed algorithm, named $\texttt{KOBEsim}$. The algorithm selects the next observing date that maximizes the Bayesian evidence for such periodicity in comparison with a model with no Keplerian orbits. By means of simulated data, we prove that the algorithm accelerates the exoplanet detection, needing $29 - 33\,\%$ less observations and $41 - 47\,\%$ less timespan of the full dataset for low-mass planets ($m_{\rm p}\,<\,10\,M_{\oplus}$) in comparison with a conventional monotonic cadence strategy. The enhancement in the number of datapoints for $20\,M_{\oplus}$ planets is also appreciable, $16\,\%$. We also test $\texttt{KOBEsim}$ with real data for a particular KOBE target, and for the confirmed planet $HD~102365\,b$. Both of them demonstrate that the strategy is capable of speeding up the detection up to a factor of $2$.