A fast algorithm for computing the Hartley/ Fourier spectrum

A fast algorithm for computing distance spectrum of convolutional codes

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Fourier Codes and Hartley Codes

—Real-valued block codes are introduced, which are derived from Discrete Fourier Transforms (DFT) and Discrete Hartley Transforms (DHT). These algebraic structures are built from the eigensequences of the transforms. Generator and parity check matrices were computed for codes up to block length N=24. They can be viewed as lattices codes so the main parameters (dimension, minimal norm, area of t...

A Fast Immersed Boundary Fourier Pseudo-spectral Method for Simulation of the Incompressible Flows

Abstract   The present paper is devoted to implementation of the immersed boundary technique into the Fourier pseudo-spectral solution of the vorticity-velocity formulation of the two-dimensional incompressible Navier-Stokes equations. The immersed boundary conditions are implemented via direct modification of the convection and diffusion terms, and therefore, in contrast to some other similar ...

SPECTRUM OF THE FOURIER-STIELTJES ALGEBRA OF A SEMIGROUP

For a unital foundation topological *-semigroup S whose representations separate points of S, we show that the spectrum of the Fourier-Stieltjes algebra B(S) is a compact semitopological semigroup. We also calculate B(S) for several examples of S.