One half-grid sine-transform convention is
For on a square with homogeneous Dirichlet boundary conditions, the five-point finite difference operator on a mesh is diagonalized by . Its eigenvalues are . A two-dimensional discrete sine transform, division by these nonzero eigenvalues and the inverse transform give the solution. Odd extension realizes each one-dimensional transform by a Fast Fourier transform of length , making the total cost and storage . These finite-difference eigenvalues should not be confused with the continuous spectral eigenvalues .
Use the half-grid type-II discrete sine transform
Set , and let use the matching type-II discrete cosine transform normalization. The elementary identity
gives . A sign modulation, one fast discrete cosine transform, and reversal of the outputs compute this discrete sine transform in operations. This identity depends on the half-grid conventions; it is not the endpoint-grid sine transform used by the discrete sine transform Poisson solver.

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.