نتایج جستجو برای: fast hankel transforms
تعداد نتایج: 251239 فیلتر نتایج به سال:
This paper shows that there are fast Fourier transform (FFT) algorithms that work, for a fixed number of points, independent of the dimension. Changing the dimension is achieved by relabeling the input and the output and changing the “twiddle factors.” An important consequence of this result, is that a program designed to compute the 1-dimensional Fourier transform can be easily modified to com...
This paper describes two digital implementations of a new mathematical transform, namely, the second generation curvelet transform [12, 10] in two and three dimensions. The first digital transformation is based on unequally-spaced fast Fourier transforms (USFFT) while the second is based on the wrapping of specially selected Fourier samples. The two implementations essentially differ by the cho...
We prove that the fast pseudo-Hadamard transform (FPHT) over a finite field has a bounded branch number. We shall demonstrate that the transform has an efficient implementation for various platforms compared to an equal dimension MDS code. We prove that when using a CS-Cipher[3] like construction the weight of any 2R trail is bounded for the case of an 8 × 8 transform. We show that the FPHT can...
The purpose of this paper is to present an algorithm for evaluating Han-kel transform of the null and the first kind. The result is the exact analytical representation as the series of the Bessel and Struve functions multiplied by the wavelet coefficients of the input function. Numerical evaluation of the test function with known analytical Hankel transform illustrates the proposed algorithm. T...
The paper gives a self-contained survey of fast algorithms for solving linear systems of equations with Toeplitz or Hankel coefficient matrices. It is written in the style of a textbook. Algorithms of Levinson-type and of Schur-type are discussed. Their connections with triangular factorizations, Padè recursions and Lanczos methods are demonstrated. In the case in which the matrices possess add...
Many computational problems can be solved with the aid of contour integrals containing e in the integrand: examples include inverse Laplace transforms, special functions, functions of matrices and operators, parabolic PDEs, and reaction-diffusion equations. One approach to the numerical quadrature of such integrals is to apply the trapezoid rule on a Hankel contour defined by a suitable change ...
Two recent approaches [4, 14] in subspace identification problems require the computation of the R factor of the QR factorization of a block–Hankel matrix H , which, in general has a huge number of rows. Since the data are perturbed by noise, the involved matrix H is, in general, full rank. It is well known that, from a theoretical point of view, the R factor of the QR factorization of H is equ...
Recent research shows that structured matrices such as Toeplitz and Hankel matrices can be transformed into a diierent class of structured matrices called Cauchy-like matrices using the FFT or other trigonometric transforms. Gohberg, Kailath and Olshevsky demonstrate numerically that their fast variation of the straightforward Gaussian elimination with partial pivoting (GEPP) procedure on Cauch...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید