Ein Programm zur Periodensuche bei großen Anzahlen von Meßwerten

Abstract

1: s wird cine Mcthotlc zur I'crioclciisuclic in unifaiigreiclicn hIcUrcihen h*schricbcri. I h s Vcrfiilircii k r u l i t , \vie die Mctliotle \on LAFLER untl KISMAS, auf clcr Ucrechnung clcr Strcuutig. Da das Verfahren abcr nicht tler Sortierung der MeUwcrte nacli tlcr I'hasc bedarf, lasscn sich I'eriodogranimc wcscntlich schncllcr krcchnen. Bin I~OKTH.4N-l'rogranim wird angegcben..\ method for the search of periods in large series of observational data is discribcd. Like that proposed by LAFLER and lirs-M A S our procedure is bascd on the computation of the variance, however, the speed of computation of periodogranims is coiisidcrably higher since w c tlo not need to size the valucs with regard to the phasc. A 1WRTRAN-programm is given.

BV Observations of the Long-Period Cepheid S Vulpeculae

“…Under the assumption that there are no cycle-to-cycle changes during the ascending branch of the S Vul V light curve which are greater than the observational errors in the photometry, then a linear least-squares analysis of the APT data over this time interval yields a period of 68.347 days. A comparable analysis of the A second technique used to help determine the period from the S Vul APT observations makes use of a Lafler-Kinman-like procedure due to Schöneich and Lange (1981). This procedure bins the data by phase until, essentially, the sum of the squares of the magnitude residuals from all the phase bins is a minimum.…”