Related papers: Computation of hyperspherical Bessel functions
We investigate the internal space of Bessel functions which is associated to the group Z of positive and negative integers defining their orders. As a result we propose and prove a new unifying formula (to be added to the huge literature on…
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 give a systematic and unified discussion of various classes of hypergeometric type equations: the hypergeometric equation, the confluent equation, the F_1 equation (equivalent to the Bessel equation), the Gegenbauer equation and the…
In a recent paper we unified Bessel functions of different orders .Here we extend the unification to other linairely independant solutions to Bessel equation, Neumann's and Hankel's functions
We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…
In the relativistic and the nonrelativistic theoretical treatment of moderate and high-power laser-matter interaction, the generalized Bessel function occurs naturally when a Schr\"odinger-Volkov and Dirac-Volkov solution is expanded into…
Tensor operations are surging as the computational building blocks for a variety of scientific simulations and the development of high-performance kernels for such operations is known to be a challenging task. While for operations on one-…
The main purpose of this paper is to compute all irreducible spherical functions on $G={SL}(2,{\mathbb C})$ of arbitrary type $\delta\in \hat K$, where $K={SU}(2)$. This is accomplished by associating to a spherical function $\Phi$ on $G$ a…
We develop numerical algorithms for the efficient evaluation of quantities associated with generalized matrix functions [J. B. Hawkins and A. Ben-Israel, Linear and Multilinear Algebra 1(2), 1973, pp. 163-171]. Our algorithms are based on…
Integrals involving highly oscillatory Bessel functions are notoriously challenging to compute using conventional integration techniques. While several methods are available, they predominantly cater to integrals with at most a single…
A new robust algorithm for the numerical computation of biarcs, i.e. $G^1$ curves composed of two arcs of circle, is presented. Many algorithms exist but are based on geometric constructions, which must consider many geometrical…
Based on the characterization of the polyconvex envelope of isotropic functions by their signed singular value representations, we propose a simple algorithm for the numerical approximation of the polyconvex envelope. Instead of operating…
We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…
We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…
We present an efficient self-contained algorithm for computing the modified Bessel function of the first kind $I_{\nu}(z)$, implemented in a robust Fortran code supporting double and quadruple (quad) precision. The algorithm overcomes the…
Kummer's function, also known as the confluent hypergeometric function (CHF), is an important mathematical function, in particular due to its many special cases, which include the Bessel function, the incomplete Gamma function and the error…
The modified Bessel function of the second kind K$\nu$ appears in a wide variety of applied scientific fields. While its use is greatly facilitated by an implementation in most numerical libraries, overflow issues can be encountered…
Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…
Gaussian processes are popular and flexible models for spatial, temporal, and functional data, but they are computationally infeasible for large datasets. We discuss Gaussian-process approximations that use basis functions at multiple…
The symbolic method is used to get explicit formulae for the products or powers of Bessel functions and for the relevant integrals.