In this paper we study the effective thermal behaviour of 3D representative volume elements (RVEs) of two-phased composite materials constituted by a matrix with cylindrical and spherical inclusions distributed randomly, with periodic boundaries. Variations around the shape of inclusions have been taken into account, by corrugating shapes, excavating and/or by removing pieces of inclusions. The...

Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of FFT and propose a new presentation. Our heuristic description is helpful for students and programmers to grasp the algorithm entirely and deeply.

A divide and conquer algorithm is presented for computing arbitrary multi-dimensional discrete Fourier transforms. In contrast to standard approaches such as the row-column algorithm, this algorithm allows an arbitrary decomposition, based solely on the size of the transform independent of the dimension of the transform. Only minor modifications are required to compute transforms with different...

in this study, simple, fast and reliable cyclic voltammetry (cv), linear sweep voltammetry (lsv), square wave voltammetry (swv) and differential pulse voltammetry (dpv) methods were developed and validated for determination of bosentan in pharmaceutical preparations. the proposed methods were based on electrochemical oxidation of bosentan at platinum electrode in acetonitrile solution containin...

We present an efficient algorithm for approximately maintaining and updating a distribution over permutations matching tracks to real world objects. The algorithm hinges on two insights from the theory of harmonic analysis on noncommutative groups. The first is that most of the information in the distribution over permutations is captured by certain “low frequency” Fourier components. The secon...

In this paper, we discuss the design and implementation of a high-speed, low power 1024-point pipeline FFT processor. Key features are flexible internal data length and a novel processing element. The FFT processor, which is implemented in a standard 035 pm CMOS process, is efficient in term of power consumption and chip area.

Assuming a conjectural upper bound for the least prime in an arithmetic progression, we show that n-bit integers may be multiplied in O(n logn 4 ∗ n) bit operations.

An improved approach to updating the electric field in simulations of Coulomb gases using the local lattice technique introduced by Maggs and Rossetto [1], is described and tested. Using the Fast Fourier Transform (FFT) an independent configuration of electric fields subject to Gauss’ law constraint can be generated in a single update step. This FFT based method is shown to outperform previous ...