It is shown that if division and multiplication in a Euclidean domain can be performed in O(N log ~ N) steps, then the residues of an N precision element in the domain can be computed in O(N log a+l N) steps. A special case of this result is that the residues of an N precision integer can be computed in O(N logS N log log N) total operations. Using a polynomial division algorithm due to Strasse...

The linear canonical transform provides a mathematical model of paraxial propagation though quadratic phase systems. We review the literature on numerical approximation of this transform, including discretization, sampling, and fast algorithms, and identify key results. We then propose a frequency-division fast linear canonical transform algorithm comparable to the Sande-Tukey fast Fourier tran...

Orthogonal systems in L2(ℝ), once implemented spectral methods, enjoy a number of important advantages if their differentiation matrix is skew-symmetric and highly structured. Such systems, where the skew-symmetric, tridiagonal, irreducible, have been recently fully characterised. In this paper we go step further, imposing extra requirement fast computation: specifically, that first N coefficie...

29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...

This paper deals with discontinuities analysis in the temperature, displacement, and stress fields of a thick plate whose lower and upper surfaces are traction-free and subjected to a given axisymmetric temperature distribution. The analysis is carried out under three thermoelastic theories. Potential functions together with Laplace and Hankel transform techniques are used to derive the solutio...