USGS · 70015761
A hybrid fast Hankel transform algorithm for electromagnetic modeling
Abstract
A hybrid fast Hankel transform algorithm has been developed that uses several complementary features of two existing algorithms: Anderson's digital filtering or fast Hankel transform (FHT) algorithm and Chave's quadrature and continued fraction algorithm. A hybrid FHT subprogram (called HYBFHT) written in standard Fortran-77 provides a simple user interface to call either subalgorithm. The hybrid approach is an attempt to combine the best features of the two subalgorithms to minimize the user's coding requirements and to provide fast execution and good accuracy for a large class of electromagnetic problems involving various related Hankel transform sets with multiple arguments. Special cases of Hankel transforms of double-order and double-argument are discussed, where use of HYBFHT is shown to be advantageous for oscillatory kernel functions.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
W.L. Anderson. 1989. A hybrid fast Hankel transform algorithm for electromagnetic modeling. https://doi.org/10.1190/1.1442650
Cite the original work for its findings. Save a collection to share your selection of sources.