A fast hybrid algorithm for exoplanetary transit searches
. (2006) A fast hybrid algorithm for exoplanetary transit searches. Monthly Notices of the Royal Astronomical Society, 373 (2). pp. 799-810. ISSN 0035-8711 Full text not available from this repository.
Official URL: http://dx.doi.org/10.1111/j.1365-2966.11074.x
We present a fast and efficient hybrid algorithm for selecting exoplanetary candidates from wide-field transit surveys. Our method is based on the widely used SysRem and Box Least-Squares (BLS) algorithms. Patterns of systematic error that are common to all stars on the frame are mapped and eliminated using the SysRem algorithm. The remaining systematic errors caused by spatially localized flat-fielding and other errors are quantified using a boxcar-smoothing method. We show that the dimensions of the search-parameter space can be reduced greatly by carrying out an initial BLS search on a coarse grid of reduced dimensions, followed by Newton-Raphson refinement of the transit parameters in the vicinity of the most significant solutions. We illustrate the method's operation by applying it to data from one field of the SuperWASP survey, comprising 2300 observations of 7840 stars brighter than V = 13.0. We identify 11 likely transit candidates. We reject stars that exhibit significant ellipsoidal variations caused indicative of a stellar-mass companion. We use colours and proper motions from the Two Micron All Sky Survey and USNO-B1.0 surveys to estimate the stellar parameters and the companion radius. We find that two stars showing unambiguous transit signals pass all these tests, and so qualify for detailed high-resolution spectroscopic follow-up.
|Item Type:||Journal Article|
|Subjects:||Q Science > QB Astronomy|
|Divisions:||Faculty of Science > Physics|
|Journal or Publication Title:||Monthly Notices of the Royal Astronomical Society|
|Official Date:||1 December 2006|
|Number of Pages:||12|
|Page Range:||pp. 799-810|
|Access rights to Published version:||Restricted or Subscription Access|
Actions (login required)