On computation of the Bessel function by summing up the series
From MaRDI portal
Publication:5043040
DOI10.15372/SJNM20190405WikidataQ100935624 ScholiaQ100935624MaRDI QIDQ5043040
Publication date: 26 October 2022
Published in: Сибирский журнал вычислительной математики (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/sjvm725
computational complexityfast algorithmsBessel functionsFEE methodefficient calculationlarge argument
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comments to my works, written by myself
- Approximation of the Bessel function \(J_ n(\)x) by numerical integration
- Fast evaluation of transcendental functions
- Fast evaluation of the Hurwitz zeta function and Dirichlet \(L\)-series
- On the evaluation of Bessel functions
- On the computation of the Euler constant \({\gamma}\)
- Computation of Bessel and Airy functions and of related Gaussian quadrature formulae
- Fast computation of the Riemann zeta-function \(\zeta (s)\) for integer values of the argument \(s\)
- Numerical calculation of Bessel, Hankel and Airy functions
- On one method for fast approximation of zeta constants by rational fractions
- Fast Catalan constant computation via the approximations obtained by the Kummer's type transformations
- On the computation of Bessel functions of first kind
- The evaluation of Bessel functions via exp-arc integrals
- On the asymptotics of Bessel functions in the Fresnel regime
- High-precision evaluation of the Bessel functions via Hadamard series
- Gaussian elimination is not optimal
- Fast multiplication of large numbers
- An algorithm for the rapid numerical evaluation of Bessel functions of real orders and arguments
- The asymptotic solution of linear differential equations of the second order for large values of a parameter
- Faster Integer Multiplication
- On the Asymptotic Complexity of Matrix Multiplication
- On a new method for fast evaluation of transcendental functions
- Computation of π Using Arithmetic-Geometric Mean
- New Backward Recurrences for Bessel Functions
- Fast Computation of Some Special Integrals of Mathematical Physics
- Fast evaluation of bessel functions
- Approximations for the Bessel and Airy functions with an explicit error term
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Algorithms Involving Arithmetic and Geometric Means
- An Algorithm for Computing Logarithms and Arctangents
- On the asymptotic representation of the Euler gamma function by Ramanujan
- Fast computation of \(\zeta(3)\) and of some special integrals using the Ramanujan formula and polylogarithms
