fleck: Fast approximate light curves for starspot rotational modulation
نویسندگان
چکیده
منابع مشابه
Fast identification of transits from light-curves
We present an algorithm that allows fast and efficient detection of transits, including planetary transits, from light-curves. The method is based on building an ensemble of fiducial models and compressing the data using the MOPED algorithm. We describe the method and demonstrate its efficiency by finding planet-like transits in simulated Pan-STARRS light-curves. We show that that our method is...
متن کاملFast Approximate Implicitization of Envelope Curves using Chebyshev Polynomials
Consider a rational family of planar rational curves in a certain region of interest. We are interested in finding an approximation to the implicit representation of the envelope. Since exact implicitization methods tend to be very costly, we employ an adaptation of approximate implicitization to envelope computation. Moreover, by utilizing an orthogonal basis in the construction process, the c...
متن کاملApproximate Bézier curves by cubic LN curves
In order to derive the offset curves by using cubic Bézier curves with a linear field of normal vectors (the so-called LN Bézier curves) more efficiently, three methods for approximating degree n Bézier curves by cubic LN Bézier curves are considered, which includes two traditional methods and one new method based on Hausdorff distance. The approximation based on shifting control points is equi...
متن کاملFast rotational matching.
A computationally efficient method is presented - 'fast rotational matching' or FRM - that significantly accelerates the search of the three rotational degrees of freedom (DOF) in biomolecular matching problems. This method uses a suitable parametrization of the three-dimensional rotation group along with spherical harmonics, which allows efficient computation of the Fourier Transform of the ro...
متن کاملFast approximate subspace tracking (FAST)
A new fast and accurate algorithm for tracking singular values, singular vectors and the dimension of the signal subspace through an overlapping sequence of data matrices is presented. The accuracy of the algorithm approaches that of the Prony-Lanczos (PL) method [1] with speed and accuracy superior to both the PAST and PASTd algorithms [2] for moderate to large size problems. The algorithm is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Open Source Software
سال: 2020
ISSN: 2475-9066
DOI: 10.21105/joss.02103