An Algorithm for Fresnel Diffraction Computing Based on Fractional Fourier Transform

The fractional Fourier transform (FrFT) is used for the solution of the diffraction integral in optics. A scanning approach is proposed for finding the optimal FrFT order. In this way, the process of diffraction computing is speeded up. The basic algorithm and the intermediate results at each stage are demonstrated.

Fourier Neural Networks: An Approach with Sinusoidal Activation Functions

* Supported by INTAS 2000-626, INTAS YSF 03-55-1969, INTAS INNO 182, and TIC 2003-09319-c03-03.

A Generalized Convolution with a Weight Function for the Fourier Cosine and Sine Transforms

A generalized convolution with a weight function for the Fourier cosine and sine transforms is introduced. Its properties and applications to solving a system of integral equations are considered.

On the Range of the Fourier Transform Associated with the Spherical Mean Operator

We characterize the range of some spaces of functions by the Fourier transform associated with the spherical mean operator R and we give a new description of the Schwartz spaces. Next, we prove a Paley-Wiener and a Paley-Wiener-Schawrtz theorems.

On generalized orlicz sequence spaces of Fourier coefficients for trigonometric gap series. I.

We investigate the operator associating with a function fєLp2π, 1Fourier coefficients of ƒ with respect to a trigonometric gap system, as well as an operator from a modular space X ρs(ϕ) to the generalized Orlicz sequence space lϕ.

On the Mixed Modulus of Smoothness and a Class of Double Fourier Series

MSC 2010: 42A32; 42A20