1,275 research outputs found

    Asymptotic expansions and fast computation of oscillatory Hilbert transforms

    Full text link
    In this paper, we study the asymptotics and fast computation of the one-sided oscillatory Hilbert transforms of the form H+(f(t)eiωt)(x)=int0eiωtf(t)txdt,ω>0,x0,H^{+}(f(t)e^{i\omega t})(x)=-int_{0}^{\infty}e^{i\omega t}\frac{f(t)}{t-x}dt,\qquad \omega>0,\qquad x\geq 0, where the bar indicates the Cauchy principal value and ff is a real-valued function with analytic continuation in the first quadrant, except possibly a branch point of algebraic type at the origin. When x=0x=0, the integral is interpreted as a Hadamard finite-part integral, provided it is divergent. Asymptotic expansions in inverse powers of ω\omega are derived for each fixed x0x\geq 0, which clarify the large ω\omega behavior of this transform. We then present efficient and affordable approaches for numerical evaluation of such oscillatory transforms. Depending on the position of xx, we classify our discussion into three regimes, namely, x=O(1)x=\mathcal{O}(1) or x1x\gg1, 0<x10<x\ll 1 and x=0x=0. Numerical experiments show that the convergence of the proposed methods greatly improve when the frequency ω\omega increases. Some extensions to oscillatory Hilbert transforms with Bessel oscillators are briefly discussed as well.Comment: 32 pages, 6 figures, 4 table

    On the optimal rates of convergence of Gegenbauer projections

    Full text link
    In this paper we present a comprehensive convergence rate analysis of Gegenbauer projections. We show that, for analytic functions, the convergence rate of the Gegenbauer projection of degree nn is the same as that of the best approximation of the same degree when λ0\lambda\leq0 and the former is slower than the latter by a factor of nλn^{\lambda} when λ>0\lambda>0, where λ\lambda is the parameter in Gegenbauer polynomials. For piecewise analytic functions, we demonstrate that the convergence rate of the Gegenbauer projection of degree nn is the same as that of the best approximation of the same degree when λ1\lambda\leq1 and the former is slower than the latter by a factor of nλ1n^{\lambda-1} when λ>1\lambda>1. The extension to functions of fractional smoothness is also discussed. Our theoretical findings are illustrated by numerical experiments.Comment: 30 pages; 8 figure
    corecore