Applications of the conjugate gradient fast Fourier Hankel transfer method with an improved fast Hankel transform algorithm
Article first published online: 7 DEC 2012
Copyright 1994 by the American Geophysical Union.
Volume 29, Issue 4, pages 1009–1022, July-August 1994
How to Cite
1994), Applications of the conjugate gradient fast Fourier Hankel transfer method with an improved fast Hankel transform algorithm, Radio Sci., 29(4), 1009–1022, doi:10.1029/93RS03592., and (
- Issue published online: 7 DEC 2012
- Article first published online: 7 DEC 2012
- Manuscript Accepted: 8 DEC 1993
- Manuscript Received: 17 MAR 1993
The conjugate gradient fast Fourier-Hankel transforms (CG-FFHT) method was recently proposed to solve the problems of electromagnetic wave propagation and scattering in axisymmetric inhomogeneous media. This new technique uses the CG method together with the FFHT to solve the wave equation iteratively. Each iteration of the CG method requires O(N log2 N) complex multiplications (N is the number of unknowns). For the application of low-frequency induction logging, the number of iterations is very small (less than eight). Furthermore, the CG-FFHT method only requires the storage of several vectors of dimension N. In this paper we present an improved fast Hankel transform (FHT) algorithm as well as some applications of the CG-FFHT method. It is shown that the improved FHT algorithm results in better accuracy and is more efficient than the other FHT algorithms. Moreover, with this FHT algorithm there is no need to pad the function to be transformed with zeros. Several numerical examples will be shown to illustrate the use of the improved FHT algorithm as well as the applications of the CG-FFHT method.