diff options
| author | endolith <endolith@gmail.com> | 2013-08-29 20:03:03 -0400 |
|---|---|---|
| committer | endolith <endolith@gmail.com> | 2013-08-29 20:03:03 -0400 |
| commit | e5a80eb5f4bddf9e39dfe99502d38a1fa0a9193f (patch) | |
| tree | a41e6cc802621591dc7b7e82b741dcde15105d76 /numpy/fft/fftpack.py | |
| parent | 1ab96d234d950f7d1232179deb38e73128b28194 (diff) | |
| download | numpy-e5a80eb5f4bddf9e39dfe99502d38a1fa0a9193f.tar.gz | |
DOC: change "Hermite" to "Hermitian", "though" to "although"
Diffstat (limited to 'numpy/fft/fftpack.py')
| -rw-r--r-- | numpy/fft/fftpack.py | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/numpy/fft/fftpack.py b/numpy/fft/fftpack.py index 0679bd083..9f84519a3 100644 --- a/numpy/fft/fftpack.py +++ b/numpy/fft/fftpack.py @@ -292,7 +292,7 @@ def rfft(a, n=None, axis=-1): Notes ----- When the DFT is computed for purely real input, the output is - Hermite-symmetric, i.e. the negative frequency terms are just the complex + Hermitian-symmetric, i.e. the negative frequency terms are just the complex conjugates of the corresponding positive-frequency terms, and the negative-frequency terms are therefore redundant. This function does not compute the negative frequency terms, and the length of the transformed @@ -338,7 +338,7 @@ def irfft(a, n=None, axis=-1): The input is expected to be in the form returned by `rfft`, i.e. the real zero-frequency term followed by the complex positive frequency terms in order of increasing frequency. Since the discrete Fourier Transform of - real input is Hermite-symmetric, the negative frequency terms are taken + real input is Hermitian-symmetric, the negative frequency terms are taken to be the complex conjugates of the corresponding positive frequency terms. Parameters @@ -381,7 +381,7 @@ def irfft(a, n=None, axis=-1): ----- Returns the real valued `n`-point inverse discrete Fourier transform of `a`, where `a` contains the non-negative frequency terms of a - Hermite-symmetric sequence. `n` is the length of the result, not the + Hermitian-symmetric sequence. `n` is the length of the result, not the input. If you specify an `n` such that `a` must be zero-padded or truncated, the @@ -450,7 +450,7 @@ def hfft(a, n=None, axis=-1): Notes ----- `hfft`/`ihfft` are a pair analogous to `rfft`/`irfft`, but for the - opposite case: here the signal has Hermite symmetry in the time domain + opposite case: here the signal has Hermitian symmetry in the time domain and is real in the frequency domain. So here it's `hfft` for which you must supply the length of the result if it is to be odd: ``ihfft(hfft(a), len(a)) == a``, within numerical accuracy. @@ -516,7 +516,7 @@ def ihfft(a, n=None, axis=-1): Notes ----- `hfft`/`ihfft` are a pair analogous to `rfft`/`irfft`, but for the - opposite case: here the signal has Hermite symmetry in the time domain + opposite case: here the signal has Hermitian symmetry in the time domain and is real in the frequency domain. So here it's `hfft` for which you must supply the length of the result if it is to be odd: ``ihfft(hfft(a), len(a)) == a``, within numerical accuracy. |