Orthogonal fast spherical Bessel transform on uniform grid
From MaRDI portal
Publication:2414432
Abstract: 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 Fourier transform and the orthogonal transform founded on the derivatives of the discrete Legendre orthogonal polynomials. The method utility is illustrated by its implementation for the numerical solution of the three-dimensional time-dependent Schr"odinger equation.
Recommendations
- Fast spherical Bessel transform via fast Fourier transform and recurrence formula
- Spherical Bessel transforms
- A fast transform for spherical harmonics
- Rapid application of the spherical harmonic transform via interpolative decomposition butterfly factorization
- Spherical Bessel transform via exponential sum approximation of spherical Bessel function
Cites work
- scientific article; zbMATH DE number 47257 (Why is no real title available?)
- Discrete (Legendre) orthogonal polynomials-a survey
- Fast spherical Bessel transform via fast Fourier transform and recurrence formula
- NumSBT: a subroutine for calculating spherical Bessel transforms numerically
- Numerical Fourier and Bessel transforms in logarithmic variables
- Numerical evaluation of spherical Bessel transforms via fast Fourier transforms
- The fast Hankel transform as a tool in the solution of the time dependent Schrödinger equation
Cited in
(3)
This page was built for publication: Orthogonal fast spherical Bessel transform on uniform grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2414432)