An Algorithm for Preferential Selection of Spectroscopic Targets in LEGUE
Abstract
We describe a general target selection algorithm that is applicable to any survey in which the number of available candidates is much larger than the number of objects to be observed. This routine aims to achieve a balance between a smoothly-varying, well-understood selection function and the desire to preferentially select certain types of targets. Some target-selection examples are shown that illustrate different possibilities of emphasis functions. Although it is generally applicable, the algorithm was developed specifically for the LAMOST Experiment for Galactic Understanding and Exploration (LEGUE) survey that will be carried out using the Chinese Guo Shou Jing Telescope. In particular, this algorithm was designed for the portion of LEGUE targeting the Galactic halo, in which we attempt to balance a variety of science goals that require stars at fainter magnitudes than can be completely sampled by LAMOST. This algorithm has been implemented for the halo portion of the LAMOST pilot survey, which began in October 2011.
Cite
@article{arxiv.1206.3577,
title = {An Algorithm for Preferential Selection of Spectroscopic Targets in LEGUE},
author = {Jeffrey L. Carlin and Sebastien Lepine and Heidi Jo Newberg and Licai Deng and Timothy C. Beers and Yuqin Chen and Norbert Christlieb and Xiaoting Fu and Shuang Gao and Carl J. Grillmair and Puragra Guhathakurta and Zhanwen Han and Jinliang Hou and Hsu-Tai Lee and Jing Li and Chao Liu and Xiaowei Liu and Kaike Pan and J. A. Sellwood and Hongchi Wang and Fan Yang and Brian Yanny and Yueyang Zhang and Zheng Zheng and Zi Zhu},
journal= {arXiv preprint arXiv:1206.3577},
year = {2015}
}
Comments
17 pages, 7 figures, accepted for publication in RAA