Related papers: Computation of hyperspherical Bessel functions
We propose an algorithm for the orthogonal fast discrete spherical Bessel transform on an uniform grid. Our approach is based upon the spherical Bessel transform factorization into the two subsequent orthogonal transforms, namely the fast…
Expansion of higher transcendental functions in a small parameter are needed in many areas of science. For certain classes of functions this can be achieved by algebraic means. These algebraic tools are based on nested sums and can be…
In this work, we introduce bicomplex Bessel function and analyze its region of convergence. Important properties of the bicomplex Bessel function, such as recurrence relations, integral representations, differential relations are explored.…
Gosper developed an algorithm for performing arithmetic on continued fractions (CFs), and introduced continued logarithms (CLs) as a variant of continued fractions better suited to representing extremely large (or small) numbers. CLs are…
The aim of this work is to develop a fast algorithm for approximating the matrix function $f(A)$ of a square matrix $A$ that is symmetric and has hierarchically semiseparable (HSS) structure. Appearing in a wide variety of applications,…
Deep learning is moving towards increasingly sophisticated optimization objectives that employ higher-order functions, such as integration, continuous optimization, and root-finding. Since differentiable programming frameworks such as…
The Bessel-Neumann expansion (of integer order) of a function $g:\mathbb{C}\rightarrow\mathbb{C}$ corresponds to representing $g$ as a linear combination of basis functions $\phi_0,\phi_1,\ldots$, i.e., $g(z)=\sum_{\ell = 0}^\infty w_\ell…
New index transforms, involving the square of Bessel functions of the first kind as the kernel are considered. Mapping properties such as the boundedness and invertibility are investigated for these operators in the Lebesgue spaces.…
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…
We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…
In this work the authors use their contour integral method to derive a double integral connected to the modified Bessel function of the second kind and express it in terms of the Lerch function. There are some useful results relating double…
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $P$ of degree $d$ in time $O(d\log d)$, with a low multiplicative constant independent of the precision. Subsequent evaluations of $P$…
We present a new algorithm for the computation of the inverse Abel transform, a problem which emerges in many areas of physics and engineering. We prove that the Legendre coefficients of a given function coincide with the Fourier…
In this article we present a method to implement orthogonal polynomials and many other special functions in Computer Algebra systems enabling the user to work with those functions appropriately, and in particular to verify different types…
We present a straightforward discretization of the Bessel functions $J_n(x)$ to discrete counterparts $B^{(N)}_n(x_m)$, of $N$ integer orders $n$ on $N$ integer points $x_m \equiv m$, that we call discrete Bessel functions. These are built…
In recent years, the use of sparse recovery techniques in the approximation of high-dimensional functions has garnered increasing interest. In this work we present a survey of recent progress in this emerging topic. Our main focus is on the…
A new algorithm for computing coefficients of the Baker--Campbell--Hausdorff series is presented, which can be straightforwardly implemented in any general-purpose programming language or computer algebra system. The algorithm avoids…
We develop sampling formulas for high-dimensional functions in reproducing kernel Hilbert spaces, where we rely on irregular samples that are taken at determining sequences of data points. We place particular emphasis on sampling formulas…
Second-order optimization uses curvature information about the objective function, which can help in faster convergence. However, such methods typically require expensive computation of the Hessian matrix, preventing their usage in a…
In this paper, we compare two optimization algorithms using full Hessian and approximation Hessian to obtain numerical spherical designs through their variational characterization. Based on the obtained spherical design point sets, we…