The recent numerical implementation by Fornberg and collaborators of the so-called unified method to linear elliptic PDEs in polygonal domains involves the computation of the finite Fourier transform of the Legendre polynomials. A variation of this approach, introduced by two of the authors, also involves the same computation. Here, instead of expressing the finite Fourier transform of the Lege...

and Applied Analysis 3 Let Γ(⋅) denote the gamma function. For any positive integer n and real number θ (n − 1 < θ < n), there are different definitions of fractional derivatives with order θ in [8]. During this paper, we consider the left, (right) Caputo derivative and left (right) Riemann-Liouville derivative defined as follows: (i) the left Caputo derivative: C 0 D θ t V (t) = 1 Γ (n − θ) ∫ ...

In this paper we will study the existence of fundamental solutions for the explicit and implicit backward time dependent Schödinger equation, via discrete Fourier transform and its symbol for the Laplace operator. In both cases we will prove that the discrete fundamental solutions obtained converges to the continuous fundamental solution in the l1−norm sense.

Nonaxisymmetric solutions to time-fractional diffusion-wave equation with a source term in cylindrical coordinates are obtained for an infinite medium. The solutions are found using the Laplace transform with respect to time t, the Hankel transform with respect to the radial coordinate r, the finite Fourier transform with respect to the angular coordinate φ, and the exponential Fourier transfor...

in this article, vibration analysis of an euler-bernoulli beam resting on a pasternak-type foundation is studied. the governing equation is solved by using a spectral finite element model (sfem). the solution involves calculating wave and time responses of the beam. the fast fourier transform function is used for temporal discretization of the governing partial differential equation into a set ...

We construct two-dimensional codes for correcting burst errors using the finite field Fourier transform. The encoding procedure is performed in the transformed domain using the conjugacy property of the finite field Fourier transform. The decoding procedure is also done in the transformed domain. Our code is capable of correcting multiple non-overlapping occurrence of different error patterns f...

—We consider the problem of fast computation of the Fourier transform over a finite field by decomposing an arbitrary polynomial into a sum of linearized polynomials. Examples of algorithms for the Fourier transform with complexity less than that of the best known analogs are given.