Rafael G. Campos

Rafael G. Campos, Francisco Dominguez Mota, E. Coronado

By using the three-term recurrence equation satisfied by a family of orthogonal polynomials, the Christoffel-Darboux-type bilinear generating function and their asymptotic expressions, we obtain quadrature formulas for integral transforms generated by the classical orthogonal polynomials. These integral transforms, related to the so-called Poisson integrals, correspond to a modified Fourier Transform in the case of the Hermite polynomials, a Bessel Transform in the case of the Laguerre polynomials and to an Appell Transform in the case of the Jacobi polynomials.

Rafael G. Campos, Francisco Mejia

A discrete Laplace transform and its inversion formula are obtained by using a quadrature of the continuous Fourier transform which is given in terms of Hermite polynomials and its zeros. This approach yields a convergent discrete formula for the two-sided Laplace transform if the function to be transformed falls off rapidly to zero and satisfy certain conditions of integrability, achieving convergence also for singular functions. The inversion formula becomes a quadrature formula for the Bromwich integral. This procedure also yields a quadrature formula for the Mellin transform and its corresponding inversion formula that can be generalized straightforwardly for functions of several variables.

Rafael G. Campos, J. Rico-Melgoza, Edgar Chávez

In recent years there has been a growing interest in the fractional Fourier transform driven by its large number of applications. The literature in this field follows two main routes. On the one hand, the areas where the ordinary Fourier transform has been applied are being revisited to use this intermediate time-frequency representation of signals, and on the other hand, fast algorithms for numerical computation of the fractional Fourier transform are devised. In this paper we derive a Gaussian-like quadrature of the continuous fractional Fourier transform. This quadrature is given in terms of the Hermite polynomials and their zeros. By using some asymptotic formulas, we rewrite the quadrature as a chirp-fft-chirp transformation, yielding a fast discretization of the fractional Fourier transform and its inverse in closed form. We extend the range of the fractional Fourier transform by considering arbitrary complex values inside the unitary circle and not only at the boundary. We find that, the chirp-fft-chirp transformation evaluated at z=i, becomes a more accurate version of the fft which can be used for non-periodic functions.

Rafael G. Campos, Jared Figueroa

In recent years there has been a renewed interest in finding fast algorithms to compute accurately the linear canonical transform (LCT) of a given function. This is driven by the large number of applications of the LCT in optics and signal processing. The well-known integral transforms: Fourier, fractional Fourier, bilateral Laplace and Fresnel transforms are special cases of the LCT. In this paper we obtain an O(N*Log N) algorithm to compute the LCT by using a chirp-FFT-chirp transformation yielded by a convergent quadrature formula for the fractional Fourier transform. This formula gives a unitary discrete LCT in closed form. In the case of the fractional Fourier transform the algorithm computes this transform for arbitrary complex values inside the unitary circle and not only at the boundary. In the case of the ordinary Fourier transform the algorithm improves the output of the FFT.

Rafael G. Campos, Francisco Dominguez Mota

We present a stable and convergent method for solving initial value problems based on the use of differentiation matrices obtained by Lagrange interpolation. This implicit multistep-like method is easy-to-use and performs pretty well in the solution of mildly stiff problems and it can also be applied directly to differential problems in the complex plane.

Rafael G. Campos, Claudio Meneses

A procedure to obtain differentiation matrices is extended straightforwardly to yield new differentiation matrices useful to obtain derivatives of complex rational functions. Such matrices can be used to obtain numerical solutions of some singular differential problems defined in the complex domain. The potential use of these matrices is illustrated with the case of elliptic functions.