Fast spherical Bessel transform via fast Fourier transform and recurrence formula
DOI10.1016/J.CPC.2009.09.020zbMATH Open1205.65329OpenAlexW2035033222MaRDI QIDQ615045FDOQ615045
Authors: Masayuki Toyoda, Taisuke Ozaki 
Publication date: 5 January 2011
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2009.09.020
Recommendations
numerical examplesalgorithmFourier transformsHankel transformsrecurrence formulaspherical Bessel functionsatomic orbitals
Numerical methods for trigonometric approximation and interpolation (65T40) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for integral transforms (65R10) Special integral transforms (Legendre, Hilbert, etc.) (44A15)
Cites Work
- Title not available (Why is that?)
- Numerical evaluation of the Hankel transform
- Numerical evaluation of the Hankel transform by using linear Legendre multi-wavelets
- Numerical Fourier and Bessel transforms in logarithmic variables
- NumSBT: a subroutine for calculating spherical Bessel transforms numerically
- Numerical evaluation of spherical Bessel transforms via fast Fourier transforms
Cited In (6)
- Update of spherical Bessel transform: \texttt{FFTW} and \texttt{OpenMP}
- NumSBT: a subroutine for calculating spherical Bessel transforms numerically
- \texttt{LIBERI}: Library for numerical evaluation of electron-repulsion integrals
- Spherical Bessel transforms
- Orthogonal fast spherical Bessel transform on uniform grid
- Spherical Bessel transform via exponential sum approximation of spherical Bessel function
Uses Software
This page was built for publication: Fast spherical Bessel transform via fast Fourier transform and recurrence formula
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q615045)
