1
- .. image :: https://github.com/prisae /fftlog/workflows/pytest/badge.svg?branch=master
2
- :target: https://github.com/prisae /fftlog/actions
1
+ .. image :: https://github.com/emsig /fftlog/workflows/pytest/badge.svg?branch=master
2
+ :target: https://github.com/emsig /fftlog/actions
3
3
:alt: GitHub Actions
4
4
.. image :: https://zenodo.org/badge/DOI/10.5281/zenodo.3830534.svg
5
5
:target: https://doi.org/10.5281/zenodo.3830534
@@ -13,8 +13,8 @@ This is a simple `f2py`-wrapper for the logarithmic FFT code *FFTLog* as
13
13
presented in Appendix B of [Hami00 ]_ and published at
14
14
`casa.colorado.edu/~ajsh/FFTLog <http://casa.colorado.edu/~ajsh/FFTLog >`_.
15
15
16
- A pure python version (`pyfftlog `) can be found on `github.com/prisae /pyfftlog
17
- <https://github.com/prisae /pyfftlog> `_. Tests have shown that `fftlog ` is a bit
16
+ A pure python version (`pyfftlog `) can be found on `github.com/emsig /pyfftlog
17
+ <https://github.com/emsig /pyfftlog> `_. Tests have shown that `fftlog ` is a bit
18
18
faster than `pyfftlog `, but `pyfftlog ` is easier to implement, as you only need
19
19
`NumPy ` and `SciPy `, without the need to compile anything.
20
20
@@ -28,7 +28,7 @@ test from the original code, and my use case, which is `pyfftlog.fftl` with
28
28
(forward). Please let me know if you encounter any issues.
29
29
30
30
- **Documentation **: https://pyfftlog.readthedocs.io
31
- - **Source Code **: https://github.com/prisae /fftlog
31
+ - **Source Code **: https://github.com/emsig /fftlog
32
32
33
33
**Note ** that the documentation is for the pure python version `pyfftlog `, but
34
34
equally applies to `fftlog `.
0 commit comments