`iZdZddlZddlmZddlZddlmZddlmZm Z  ddl m Z ej Z [ n"#e$rGddZeZ YnwxYwd d gZejd Zeje j dd Z eje jddZddZddZdS)z{Fast Hankel transforms using the FFTLog algorithm. The implementation closely follows the Fortran code of Hamilton (2000). N)warn)_fft)loggammapoch)fhtceZdZdZdS) _DummyModulecdS)N)selfnames k/home/jaya/work/projects/VOICE-AGENT/VIET/agent-env/lib/python3.11/site-packages/cupyx/scipy/fft/_fftlog.py __getattr__z_DummyModule.__getattr__s4N)__name__ __module__ __qualname__rr rrr r s#     rr rifhtcB|jd}|dkr=|dz dz }tj|}|tj| ||z z|zz}t |||||}t ||} |dkr$| tj| ||z |z|zzz} | S)aCompute the fast Hankel transform. Computes the discrete Hankel transform of a logarithmically spaced periodic sequence using the FFTLog algorithm [1]_, [2]_. Parameters ---------- a : cupy.ndarray (..., n) Real periodic input array, uniformly logarithmically spaced. For multidimensional input, the transform is performed over the last axis. dln : float Uniform logarithmic spacing of the input array. mu : float Order of the Hankel transform, any positive or negative real number. offset : float, optional Offset of the uniform logarithmic spacing of the output array. bias : float, optional Exponent of power law bias, any positive or negative real number. Returns ------- A : cupy.ndarray (..., n) The transformed output array, which is real, periodic, uniformly logarithmically spaced, and of the same shape as the input array. See Also -------- :func:`scipy.special.fht` :func:`scipy.special.fhtoffset` : Return an optimal offset for `fht`. References ---------- .. [1] Talman J. D., 1978, J. Comp. Phys., 29, 35 .. [2] Hamilton A. J. S., 2000, MNRAS, 312, 257 (astro-ph/9905191) rroffsetbiasshapecupyarangeexpfhtcoeff_fhtq) adlnmurrnj_cjuAs rrr sP  A qyysAg KNN $C,-- - CF666A a A qyy TXtea#gs]V34 5 55 HrcD|jd}|dkr?|dz dz }tj|}|tj|||z |z|zzz}t |||||}t ||d} |dkr!| tj| ||z z|zz} | S)aPCompute the inverse fast Hankel transform. Computes the discrete inverse Hankel transform of a logarithmically spaced periodic sequence. This is the inverse operation to `fht`. Parameters ---------- A : cupy.ndarray (..., n) Real periodic input array, uniformly logarithmically spaced. For multidimensional input, the transform is performed over the last axis. dln : float Uniform logarithmic spacing of the input array. mu : float Order of the Hankel transform, any positive or negative real number. offset : float, optional Offset of the uniform logarithmic spacing of the output array. bias : float, optional Exponent of power law bias, any positive or negative real number. Returns ------- a : cupy.ndarray (..., n) The transformed output array, which is real, periodic, uniformly logarithmically spaced, and of the same shape as the input array. See Also -------- :func:`scipy.special.ifht` :func:`scipy.special.fhtoffset` : Return an optimal offset for `fht`. rrrrrT)inverser) r+r%r&rrr'r(r)r*r$s rrr_sF  A qyy1uk KNN !c'S6!9:;; ; CF666A aD!!!A qyy TXteq3w'#- . .. Hrc||}}|dz|zdz }|dz|z dz }tjdtj|dzz||zz |dzdz} tj|dzdzt } tj|dzdzt } | | jdd<|| jdd<t| | || jdd<t| | | dt|z zz} | xj| jzc_| xjt|zz c_| xj| jz c_| xj| z c_tj | | d| jd<tj | dsd|zt|||z z| d<| S)z?Compute the coefficient array for a fast Hankel transform. rrr)dtypeN)outr) rlinspacemathpiemptycompleximagrealrLN_2r!isfiniter) r'r%r&rrlnkrqxpxmyr*vs rr"r"sd!D q&1*aB q&1*aB aAF+q3w7a!DDA 16A:W---A 16A:W---AAF111IAF111I QAAF111I QAdTk AFFafFFFFdQhFFFFafFFFFaKFFHQAAF2J =1  (!td2rBw'''! HrFc|jd}tj|dr+|s)td|}d|d<n@|ddkr4|r2td|}tj|d<t j|d}|s||z}n||z}t j ||d}|ddddf}|S)zUCompute the biased fast Hankel transform. This is the basic FFTLog routine. rrz.singular transform; consider changing the biasz6singular inverse transform; consider changing the bias)axis.N) rrisinfrcopyinfrrfftconjirfft)r$r*r-r'r+s rr#r#s  A z!A$   =>>> FFHH! 1w EFFF FFHHx! !"A  Q QVVXX  1ab!!!A #ttt) A Hr)rr)F)__doc__r2warningsrrcupyx.scipy.fftrcupyx.scipy.specialrr scipy.fftr_fht _scipy_fft ImportErrorr __all__logr8 _implementsrr"r#r rrrSs  ........  %%%%%%J    JJJ   &/tx{{*.!!; ; ; "!; |*/""6 6 6 #"6 r% % % % P       s/A A