We introduce a fast algorithm for the numerical application to arbitrary vectors of several special function transforms. The algorithm requires O(n log(n)) operations to apply to an arbitrary vector any n×n matrix such that the rank of any p×q contiguous submatrix is bounded by a constant times pq/n. These rank bounds are proven here for the case of the Fourier-Bessel transform. Numerical exper...

This paper presents the effective control of the formation and competition of cellular patterns. Simulation and theoretical analyses are carried out for pattern formation in a confined circular domain. The Cahn–Hilliard equation is solved with the zero-flux boundary condition to describe the phase separation of binary mixtures. A wavelet-based discrete singular convolution algorithm is employed...

A procedure leading to specific properties of the symmetric stable distribution functions results by subjecting certain generalizations of the Bessel functions Ja{t) to a limit process. 1 There arises the question as to the existence of the corresponding distributions in case the limit process involved is omitted. The object of this note is to delimit the conditions under which the answer is af...

Hadamard transform is an important tool in discrete signal processing. In this paper, we define the discrete fractional Hadamard transform which is a generalized one. The development of discrete fractional Hadamard is based upon the same spirit of discrete fractional Fourier transform.

The sampling theory is basic and crucial in engineering sciences. On the other hand, the linear canonical transform (LCT) is also of great power in optics, filter design, radar system analysis and pattern recognition, etc. The Fourier transform (FT), the fractional Fourier transform (FRFT), Fresnel transform (FRT) and scaling operations are considered as special cases of the LCT. In this paper,...