Evaluation of Two Transit Algorithms

ORAL

Abstract

Crucial in the data pipeline for transit searches are dependable algorithms which hunt for transits in accumulated light curves. We used C$++$ versions of EEBLS (Edge Enhanced Box Least Squares) and QATS (Quasi Automated Transit Search) algorithms to search for possible transits in the STExT group database of light curves of approximately 2500 stars. The outputs of these two programs were compared and a list of potential binary candidates was determined. We will compare the algorithms and discuss possible candidates for transits.

–

Authors

  • Matthew Heuser

    • University of Dallas

  • Richard Olenick

    • University of Dallas

  • Arthur Sweeney

    • University of Dallas

  • James Meier

    • University of Dallas

  • Jeff Schneiderjan

    • University of Dallas