dFBT-FJ

2017-11-06T10:00:48Z (GMT) by Oliver Melchert
Efficient polar convolution based on the discrete Fourier-Bessel transform for application in computational biophotonics.

dFBT-FJ implements the technical basis for efficient algorithms for the accurate forward and reverse evaluation of the discrete Fourier-Bessel transform (dFBT) as numerical tools to assist in the 2D polar convolution of two radially symmetric functions, relevant, e.g., to applications in computational biophotonics.