626,332 research outputs found

    Determination of fundamental asteroseismic parameters using the Hilbert transform

    Full text link
    Context. Solar-like oscillations exhibit a regular pattern of frequencies. This pattern is dominated by the small and large frequency separations between modes. The accurate determination of these parameters is of great interest, because they give information about e.g. the evolutionary state and the mass of a star. Aims. We want to develop a robust method to determine the large and small frequency separations for time series with low signal-tonoise ratio. For this purpose, we analyse a time series of the Sun from the GOLF instrument aboard SOHO and a time series of the star KIC 5184732 from the NASA Kepler satellite by employing a combination of Fourier and Hilbert transform. Methods. We use the analytic signal of filtered stellar oscillation time series to compute the signal envelope. Spectral analysis of the signal envelope then reveals frequency differences of dominant modes in the periodogram of the stellar time series. Results. With the described method the large frequency separation Δν\Delta\nu can be extracted from the envelope spectrum even for data of poor signal-to-noise ratio. A modification of the method allows for an overview of the regularities in the periodogram of the time series.Comment: 7 pages, 7 figures, 2 tables, submitted to A&

    Static Structural Signatures of Nearly Jammed Disordered and Ordered Hard-Sphere Packings: Direct Correlation Function

    Full text link
    Dynamical signatures are known to precede jamming in hard-particle systems, but static structural signatures have proven more elusive. The observation that compressing hard-particle packings towards jamming causes growing hyperuniformity has paved the way for the analysis of jamming as an "inverted critical point" in which the direct correlation function c(r)c(r) diverges. We establish quantitative relationships between various singularities in c(r)c(r) and the total correlation function h(r)h(r) that provide a concrete means of identifying features that must be expressed in c(r)c(r) if one hopes to reproduce details in the pair correlation function accurately. We also analyze systems of three-dimensional monodisperse hard-spheres of diameter DD as they approach ordered and disordered jammed configurations. For the latter, we use the Lubachevsky-Stillinger (LS) and Torquato-Jiao (TJ) packing algorithms, which both generate disordered packings, but can show perceptible structural differences. We identify a short-ranged scaling c(r)1/rc(r) \propto -1/r as r0r \rightarrow 0 and show that this, along with the developing delta function at c(D)c(D), is a consequence of the growing long-rangedness in c(r)c(r). Near the freezing density, we identify qualitative differences in the structure factor S(k)S(k) as well as c(r)c(r) between TJ- and LS-generated configurations and link them to differences in the protocols' packing dynamics. Configurations from both algorithms have structure factors that approach zero in the low-wavenumber limit as jamming is approached and are shown to exhibit a corresponding power-law decay in c(r)c(r) for large rr as a consequence. Our work advances the notion that static signatures are exhibited by hard-particle packings as they approach jamming and underscores the utility of the direct correlation function as a means of monitoring for an incipient rigid network

    Regression Driven F--Transform and Application to Smoothing of Financial Time Series

    Full text link
    In this paper we propose to extend the definition of fuzzy transform in order to consider an interpolation of models that are richer than the standard fuzzy transform. We focus on polynomial models, linear in particular, although the approach can be easily applied to other classes of models. As an example of application, we consider the smoothing of time series in finance. A comparison with moving averages is performed using NIFTY 50 stock market index. Experimental results show that a regression driven fuzzy transform (RDFT) provides a smoothing approximation of time series, similar to moving average, but with a smaller delay. This is an important feature for finance and other application, where time plays a key role.Comment: IFSA-SCIS 2017, 5 pages, 6 figures, 1 tabl

    Towards the quantum Brownian motion

    Full text link
    We consider random Schr\"odinger equations on \bR^d or \bZ^d for d3d\ge 3 with uncorrelated, identically distributed random potential. Denote by λ\lambda the coupling constant and ψt\psi_t the solution with initial data ψ0\psi_0. Suppose that the space and time variables scale as xλ2κ/2,tλ2κx\sim \lambda^{-2 -\kappa/2}, t \sim \lambda^{-2 -\kappa} with 0<κκ00< \kappa \leq \kappa_0, where κ0\kappa_0 is a sufficiently small universal constant. We prove that the expectation value of the Wigner distribution of ψt\psi_t, \bE W_{\psi_{t}} (x, v), converges weakly to a solution of a heat equation in the space variable xx for arbitrary L2L^2 initial data in the weak coupling limit λ0\lambda \to 0. The diffusion coefficient is uniquely determined by the kinetic energy associated to the momentum vv.Comment: Self-contained overview (Conference proceedings). The complete proof is archived in math-ph/0502025. Some typos corrected and new references added in the updated versio

    A new Truncated Fourier Transform algorithm

    Full text link
    Truncated Fourier Transforms (TFTs), first introduced by Van der Hoeven, refer to a family of algorithms that attempt to smooth "jumps" in complexity exhibited by FFT algorithms. We present an in-place TFT whose time complexity, measured in terms of ring operations, is comparable to existing not-in-place TFT methods. We also describe a transformation that maps between two families of TFT algorithms that use different sets of evaluation points.Comment: 8 pages, submitted to the 38th International Symposium on Symbolic and Algebraic Computation (ISSAC 2013

    Fast directional spatially localized spherical harmonic transform

    Get PDF
    We propose a transform for signals defined on the sphere that reveals their localized directional content in the spatio-spectral domain when used in conjunction with an asymmetric window function. We call this transform the directional spatially localized spherical harmonic transform (directional SLSHT) which extends the SLSHT from the literature whose usefulness is limited to symmetric windows. We present an inversion relation to synthesize the original signal from its directional-SLSHT distribution for an arbitrary window function. As an example of an asymmetric window, the most concentrated band-limited eigenfunction in an elliptical region on the sphere is proposed for directional spatio-spectral analysis and its effectiveness is illustrated on the synthetic and Mars topographic data-sets. Finally, since such typical data-sets on the sphere are of considerable size and the directional SLSHT is intrinsically computationally demanding depending on the band-limits of the signal and window, a fast algorithm for the efficient computation of the transform is developed. The floating point precision numerical accuracy of the fast algorithm is demonstrated and a full numerical complexity analysis is presented.Comment: 12 pages, 5 figure

    Towards an 'average' version of the Birch and Swinnerton-Dyer Conjecture

    Get PDF
    The Birch and Swinnerton-Dyer conjecture states that the rank of the Mordell-Weil group of an elliptic curve E equals the order of vanishing at the central point of the associated L-function L(s,E). Previous investigations have focused on bounding how far we must go above the central point to be assured of finding a zero, bounding the rank of a fixed curve or on bounding the average rank in a family. Mestre showed the first zero occurs by O(1/loglog(N_E)), where N_E is the conductor of E, though we expect the correct scale to study the zeros near the central point is the significantly smaller 1/log(N_E). We significantly improve on Mestre's result by averaging over a one-parameter family of elliptic curves, obtaining non-trivial upper and lower bounds for the average number of normalized zeros in intervals on the order of 1/log(N_E) (which is the expected scale). Our results may be interpreted as providing further evidence in support of the Birch and Swinnerton-Dyer conjecture, as well as the Katz-Sarnak density conjecture from random matrix theory (as the number of zeros predicted by random matrix theory lies between our upper and lower bounds). These methods may be applied to additional families of L-functions.Comment: 20 pages, 2 figures, revised first draft (fixed some typos
    corecore