"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...
In this paper, we study the stability and the stabilisation of 2 0 discrete linear systems with multiple state delays. All of the new results obtained are based on analysis of the...
Wojciech Paszke, Krzysztof Galkowski, James Lam, S...
Pollard's rho method is a randomized algorithm for computing discrete logarithms. It works by defining a pseudo-random sequence and then detecting a match in the sequence. Ma...
The characterization of signals and images in manifolds often lead to efficient dimensionality reduction algorithms based on manifold distance computation for analysis or classi...
Abstract. We present here a mathematical analysis of a nonstandard difference method for the numerical solution of the time dependent GinzburgLandau models of superconductivity. Th...