naginterfaces.library.sum.fft_​real_​cosine_​simple

naginterfaces.library.sum.fft_real_cosine_simple(m, n, x)

fft_real_cosine_simple computes the discrete Fourier cosine transforms of $m$ sequences of real data values.

For full information please refer to the NAG Library document for c06rb

https://support.nag.com/numeric/nl/nagdoc_30.3/flhtml/c06/c06rbf.html

Parameters

mint

$m$, the number of sequences to be transformed.

nint

One less than the number of real values in each sequence, i.e., the number of values in each sequence is $n+1$.

xfloat, array-like, shape $(m\times (n+3))$

The data must be stored in $x$ as if in a two-dimensional array of dimension $(1:m,0:n+2)$; each of the $m$ sequences is stored in a row of the array. In other words, if the $(n+1)$ data values of the $\text{p}$th sequence to be transformed are denoted by $x_{\text{j}}^{\text{p}}$, for $\text{p}=1,2,\dots ,m$, for $\text{j}=0,1,\dots ,n$, the first $m(n+1)$ elements of the array $x$ must contain the values

$$x_0^1,x_0^2,\dots ,x_0^m,x_1^1,x_1^2,\dots ,x_1^m,\dots ,x_n^1,x_n^2,\dots ,x_n^m\text{.}$$

The $(n+2)$th and $(n+3)$th elements of each row $x_{n+1}^{\text{p}},x_{n+2}^{\text{p}}$, for $\text{p}=1,2,\dots ,m$, are required as workspace. These $2m$ elements may contain arbitrary values as they are set to zero by the function.

Returns

xfloat, ndarray, shape $(m\times (n+3))$

The $m$ Fourier cosine transforms stored as if in a two-dimensional array of dimension $(1:m,0:n+2)$. Each of the $m$ transforms is stored in a row of the array, overwriting the corresponding original data. If the $(n+1)$ components of the $\text{p}$th Fourier cosine transform are denoted by ${\hat{x}}_{\text{k}}^{\text{p}}$, for $\text{p}=1,2,\dots ,m$, for $\text{k}=0,1,\dots ,n$, the $m(n+3)$ elements of the array $x$ contain the values

$${\hat{x}}_0^1,{\hat{x}}_0^2,\dots ,{\hat{x}}_0^m,{\hat{x}}_1^1,{\hat{x}}_1^2,\dots ,{\hat{x}}_1^m,\dots ,{\hat{x}}_n^1,{\hat{x}}_n^2,\dots ,{\hat{x}}_n^m,0,0,\dots ,0\left(2m\text{times}\right)\text{.}$$

Raises

NagValueError

(errno $1$)

On entry, $m=⟨value⟩$.

Constraint: $m\ge 1$.

(errno $2$)

On entry, $n=⟨value⟩$.

Constraint: $n\ge 1$.

(errno $3$)

An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.

Notes

No equivalent traditional C interface for this routine exists in the NAG Library.

Given $m$ sequences of $n+1$ real data values $x_{\text{j}}^{\text{p}}$, for $\text{p}=1,2,\dots ,m$, for $\text{j}=0,1,\dots ,n$, fft_real_cosine_simple simultaneously calculates the Fourier cosine transforms of all the sequences defined by

$${\hat{x}}_k^p=\sqrt{\frac{2}{n}}(\frac{1}{2}{x}_0^p+\sum _{j=1}^{n-1}{x}_j^p\times \cos \left(jk\frac{\pi }{n}\right)+\frac{1}{2}{(-1)}^k{x}_n^p)\text{,}k=0,1,\dots ,n\text{and}p=1,2,\dots ,m\text{.}$$

(Note the scale factor $\sqrt{\frac{2}{n}}$ in this definition.)

Since the Fourier cosine transform is its own inverse, two consecutive calls of fft_real_cosine_simple will restore the original data.

The transform calculated by this function can be used to solve Poisson’s equation when the derivative of the solution is specified at both left and right boundaries (see Swarztrauber (1977)).

The function uses a variant of the fast Fourier transform (FFT) algorithm (see Brigham (1974)) known as the Stockham self-sorting algorithm, described in Temperton (1983), together with pre - and post-processing stages described in Swarztrauber (1982). Special coding is provided for the factors $2$, $3$, $4$ and $5$.

References

Brigham, E O, 1974, The Fast Fourier Transform, Prentice–Hall

Swarztrauber, P N, 1977, The methods of cyclic reduction, Fourier analysis and the FACR algorithm for the discrete solution of Poisson’s equation on a rectangle, SIAM Rev. (19(3)), 490–501

Swarztrauber, P N, 1982, Vectorizing the FFT’s, Parallel Computation, (ed G Rodrique), 51–83, Academic Press

Temperton, C, 1983, Fast mixed-radix real Fourier transforms, J. Comput. Phys. (52), 340–350