Related papers: Fresnel Integral Computation Techniques
We find convergent double series expansions for Legendre's third incomplete elliptic integral valid in overlapping subdomains of the unit square. Truncated expansions provide asymptotic approximations in the neighbourhood of the logarithmic…
We implement an efficient method of computation of two dimensional Fourier-type integrals based on approximation of the integrand by Gaussian radial basis functions, which constitute a standard tool in approximation theory. As a result, we…
Filon-Clenshaw-Curtis rules are among rapid and accurate quadrature rules for computing highly oscillatory integrals. In the implementation of the Filon-Clenshaw-Curtis rules in the case when the oscillator function is not linear, its…
In this paper the problem of recovering a regularized solution of the Fredholm integral equations of the first kind with Hermitian and square-integrable kernels, and with data corrupted by additive noise, is considered. Instead of using a…
A poly-log time method to compute the truncated theta function, its derivatives, and integrals is presented. The method is elementary, rigorous, explicit, and suited for computer implementation. We repeatedly apply the Poisson summation…
This paper shows that the plane wave expansion can be a useful tool in obtaining analytical solutions to infinite integrals over spherical Bessel functions and the derivation of identites for these functions. The integrals are often used in…
We consider the asymptotic expansion of the generalised exponential integral involving the Mittag-Leffler function introduced recently by Mainardi and Masina [{\it Fract. Calc. Appl. Anal.} {\bf 21} (2018) 1156--1169]. We extend the…
In this paper, we introduce an algorithm that provides approximate solutions to semi-linear ordinary differential equations with highly oscillatory solutions, which, after an appropriate change of variables, can be rewritten as…
A new highly accurate numerical approximation scheme based on a Gauss type Clenshaw-Curtis Quadrature for Fredholm integral equations of the second kind, whose kernel is either discontinuous or not smooth along the main diagonal, is…
In this article we analyze a generalized trapezoidal rule for initial value problems with piecewise smooth right hand side \(F:\R^n\to\R^n\). When applied to such a problem the classical trapezoidal rule suffers from a loss of accuracy if…
Recently, we have proposed a new diffusive representation for fractional derivatives and, based on this representation, suggested an algorithm for their numerical computation. From the construction of the algorithm, it is immediately…
Approximation using Fourier features is a popular technique for scaling kernel methods to large-scale problems, with myriad applications in machine learning and statistics. This method replaces the integral representation of a…
This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
We describe a method to evaluate integrals that arise in the asymptotic analysis when two saddle points may be close together. These integrals, which appear in problems from optics, acoustics or quantum mechanics as well as in a wide class…
Despite extensive research on symmetric polynomial quadrature rules for triangles, as well as approaches to their calculation, few studies have focused on non-polynomial functions, particularly on their integration using symmetric triangle…
Linear second order differential equations having a large real parameter and turning point in the complex plane are considered. Classical asymptotic expansions for solutions involve the Airy function and its derivative, along with two…
In this paper, we consider the Clenshaw-Curtis-Filon method for the highly oscillatory Bessel transform $\int_0^1x^\alpha (1-x)^\beta f(x) J_{\nu}(\omega x)dx$, where $f$ is a smooth function on $[0, 1]$, and $\nu\geq0.$ The method is based…
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…
Algorithms for numerical computation of symmetric elliptic integrals of all three kinds are improved in several ways and extended to complex values of the variables (with some restrictions in the case of the integral of the third kind).…