Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFast parallel calculation of modified Bessel function of the second kind and its derivatives
82
0
0.0
(
0
)
Added by
Takashi Takekawa
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Authors
Takashi Takekawa
Ask ChatGPT about the research
No Arabic abstract
There are three main types of numerical computations for the Bessel function of the second kind: series expansion, continued fraction, and asymptotic expansion. In addition, they are combined in the appropriate domain for each. However, there are some regions where the combination of these types requires sufficient computation time to achieve sufficient accuracy, however, efficiency is significantly reduced when parallelized. In the proposed method, we adopt a simple numerical integration concept of integral representation. We coarsely refine the integration range beforehand, and stabilize the computation time by performing the integration calculation at a fixed number of intervals. Experiments demonstrate that the proposed method can achieve the same level of accuracy as existing methods in less than half the computation time.
rate research
Read More
In this paper our aim is to find the radii of starlikeness and convexity of Bessel function derivatives for three different kind of normalization. The key tools in the proof of our main results are the Mittag-Leffler expansion for nth derivative of Bessel function and properties of real zeros of it. In addition, by using the Euler-Rayleigh inequalities we obtain some tight lower and upper bounds for the radii of starlikeness and convexity of order zero for the normalized nth derivative of Bessel function. The main results of the paper are natural extensions of some known results on classical Bessel functions of the first kind.
In this paper, we investigate fast algorithms to approximate the Caputo derivative $^C_0D_t^alpha u(t)$ when $alpha$ is small. We focus on two fast algorithms, i.e. FIR and FIDR, both relying on the sum-of-exponential approximation to reduce the cost of evaluating the history part. FIR is the numerical scheme originally proposed in [16], and FIDR is an alternative scheme we propose in this work, and the latter shows superiority when $alpha$ is small. With quantitative estimates, we prove that given a certain error threshold, the computational cost of evaluating the history part of the Caputo derivative can be decreased as $alpha$ gets small. Hence, only minimal cost for the fast evaluation is required in the small $alpha$ regime, which matches prevailing protocols in engineering practice. We also present a stability and error analysis of FIDR for solving linear fractional diffusion equations. Finally, we carry out systematic numerical studies for the performances of both FIR and FIDR schemes, where we explore the trade-off between accuracy and efficiency when $alpha$ is small.
In this paper, we prove a new integral representation for the Bessel function of the first kind $J_mu(z)$, which holds for any $mu,zinmathbb{C}$.
It is well known that, with a particular choice of norm, the classical double-layer potential operator $D$ has essential norm $<1/2$ as an operator on the natural trace space $H^{1/2}(Gamma)$ whenever $Gamma$ is the boundary of a bounded Lipschitz domain. This implies, for the standard second-kind boundary integral equations for the interior and exterior Dirichlet and Neumann problems in potential theory, convergence of the Galerkin method in $H^{1/2}(Gamma)$ for any sequence of finite-dimensional subspaces $(mathcal{H}_N)_{N=1}^infty$ that is asymptotically dense in $H^{1/2}(Gamma)$. Long-standing open questions are whether the essential norm is also $<1/2$ for $D$ as an operator on $L^2(Gamma)$ for all Lipschitz $Gamma$ in 2-d; or whether, for all Lipschitz $Gamma$ in 2-d and 3-d, or at least for the smaller class of Lipschitz polyhedra in 3-d, the weaker condition holds that the operators $pm frac{1}{2}I+D$ are compact perturbations of coercive operators -- this a necessary and sufficient condition for the convergence of the Galerkin method for every sequence of subspaces $(mathcal{H}_N)_{N=1}^infty$ that is asymptotically dense in $L^2(Gamma)$. We settle these open questions negatively. We give examples of 2-d and 3-d Lipschitz domains with Lipschitz constant equal to one for which the essential norm of $D$ is $geq 1/2$, and examples with Lipschitz constant two for which the operators $pm frac{1}{2}I +D$ are not coercive plus compact. We also give, for every $C>0$, examples of Lipschitz polyhedra for which the essential norm is $geq C$ and for which $lambda I+D$ is not a compact perturbation of a coercive operator for any real or complex $lambda$ with $|lambda|leq C$. Finally, we resolve negatively a related open question in the convergence theory for collocation methods.
In this paper we propose a method for computing the Faddeeva function $w(z) := e^{-z^2}mathrm{erfc}(-i z)$ via truncated modified trapezoidal rule approximations to integrals on the real line. Our starting point is the method due to Matta and Reichel (Math. Comp. 25 (1971), pp. 339-344) and Hunter and Regan (Math. Comp. 26 (1972), pp. 339-541). Addressing shortcomings flagged by Weideman (SIAM. J. Numer. Anal. 31 (1994), pp. 1497-1518), we construct approximations which we prove are exponentially convergent as a function of $N+1$, the number of quadrature points, obtaining error bounds which show that accuracies of $2times 10^{-15}$ in the computation of $w(z)$ throughout the complex plane are achieved with $N = 11$, this confirmed by computations. These approximations, moreover, provably achieve small relative errors throughout the upper complex half-plane where $w(z)$ is non-zero. Numerical tests suggest that this new method is competitive, in accuracy and computation times, with existing methods for computing $w(z)$ for complex $z$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
