Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 2012 | Submitted
Journal Article Open

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.

Additional Information

© 2012 IOP Publishing. Received 2012 May 11; accepted 2012 June 16. Supported by the National Natural Science Foundation of China. We thank the referee, Sanjib Sharma, for helpful comments on the manuscript. This work was supported by the US National Science Foundation, through grant AST-09-37523, the National Natural Science Foundation of China (Grant Nos. 10573022, 10973015 and 11061120454) and the Chinese Academy of Sciences through grant GJHZ 200812. S. L. is supported by the US National Science Foundation grant AST-09-08419.

Attached Files

Submitted - 1206.3577v1.pdf

Files

1206.3577v1.pdf
Files (1.9 MB)
Name Size Download all
md5:4712f7611ffeee4f62832ca3c9ab6875
1.9 MB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 18, 2023