39,639 research outputs found
Fast Fourier Transforms for Finite Inverse Semigroups
We extend the theory of fast Fourier transforms on finite groups to finite
inverse semigroups. We use a general method for constructing the irreducible
representations of a finite inverse semigroup to reduce the problem of
computing its Fourier transform to the problems of computing Fourier transforms
on its maximal subgroups and a fast zeta transform on its poset structure. We
then exhibit explicit fast algorithms for particular inverse semigroups of
interest--specifically, for the rook monoid and its wreath products by
arbitrary finite groups.Comment: ver 3: Added improved upper and lower bounds for the memory required
by the fast zeta transform on the rook monoid. ver 2: Corrected typos and
(naive) bounds on memory requirements. 30 pages, 0 figure
PoisFFT - A Free Parallel Fast Poisson Solver
A fast Poisson solver software package PoisFFT is presented. It is available
as a free software licensed under the GNU GPL license version 3. The package
uses the fast Fourier transform to directly solve the Poisson equation on a
uniform orthogonal grid. It can solve the pseudo-spectral approximation and the
second order finite difference approximation of the continuous solution. The
paper reviews the mathematical methods for the fast Poisson solver and
discusses the software implementation and parallelization. The use of PoisFFT
in an incompressible flow solver is also demonstrated
A pseudospectral matrix method for time-dependent tensor fields on a spherical shell
We construct a pseudospectral method for the solution of time-dependent,
non-linear partial differential equations on a three-dimensional spherical
shell. The problem we address is the treatment of tensor fields on the sphere.
As a test case we consider the evolution of a single black hole in numerical
general relativity. A natural strategy would be the expansion in tensor
spherical harmonics in spherical coordinates. Instead, we consider the simpler
and potentially more efficient possibility of a double Fourier expansion on the
sphere for tensors in Cartesian coordinates. As usual for the double Fourier
method, we employ a filter to address time-step limitations and certain
stability issues. We find that a tensor filter based on spin-weighted spherical
harmonics is successful, while two simplified, non-spin-weighted filters do not
lead to stable evolutions. The derivatives and the filter are implemented by
matrix multiplication for efficiency. A key technical point is the construction
of a matrix multiplication method for the spin-weighted spherical harmonic
filter. As example for the efficient parallelization of the double Fourier,
spin-weighted filter method we discuss an implementation on a GPU, which
achieves a speed-up of up to a factor of 20 compared to a single core CPU
implementation.Comment: 33 pages, 9 figure
Application of Laplace transforms for the solution of transient mass- and heat-transfer problems in flow systems
A fast numerical technique for the solution of partial differential equations describing timedependent two- or three-dimensional transport phenomena is developed. It is based on transforming the original time-domain equations into the Laplace domain where numerical integration is performed and by subsequent numerical inverse transformation the final solution can be obtained. The computation time is thus reduced by more than one order of magnitude in comparison with the conventional finite-difference techniques. The effectiveness of the proposed technique is demonstrated by illustrative examples
A note on parallel and pipeline computation of fast unitary transforms
The parallel and pipeline organization of fast unitary transform algorithms such as the Fast Fourier Transform are discussed. The efficiency is pointed out of a combined parallel-pipeline processor of a transform such as the Haar transform in which 2 to the n minus 1 power hardware butterflies generate a transform of order 2 to the n power every computation cycle
- …