Time-dependent approach to scattering by Chebyshev-polynomial expansion and the fast-Fourier-transform algorithm

1998 ◽  
Vol 57 (5) ◽  
pp. 3554-3559 ◽  
Author(s):  
J. B. Wang ◽  
T. T. Scholz
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Chebyshev Polynomial ◽  
Time Dependent ◽  
Polynomial Expansion ◽  
Fast Fourier Transform Algorithm

Higher order exponential split operator method for solving time-dependent Schrödinger equations

1992 ◽  
Vol 70 (2) ◽  
pp. 555-559 ◽  
Author(s):  
André D. Bandrauk ◽  
Hai Shen
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Operator Method ◽  
Computation Time ◽  
Time Dependent ◽  
Schrodinger Equations ◽  
Schrödinger Equations ◽  
Exponential Form ◽  
Operator Solution ◽  
Split Operator

A new method of splitting exponential operators is proposed for the exponential form of the operator solution to the time-dependent Schrödinger equation. The method is shown to hold for any desired accuracy in the time increment. A comparison of different algorithms is made as a function of accuracy and computation time. Keywords: splitting operator, Fast Fourier Transform (FFT), Schrödinger equations.

SNOCRAFT: A Learning-Oriented Shorthand Notation for Creating, Representing, and Analyzing Fast Fourier Transform Algorithms

1980 ◽  
Vol 17 (3) ◽  
pp. 284-284
Author(s):  
Robert J. Meir ◽  
Sathyanarayan S. Rao
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Fourier Transforms ◽  
Reduced Form ◽  
Fast Fourier Transform Algorithm ◽  
Signal Flow Graph ◽  
Shorthand Notation ◽  
The Matrix ◽  
Fourier Algorithm ◽  
Fft Analysis

This paper presents a full and well-developed view of the Fast Fourier Transform (FFT). It is intended for the reader who wishes to learn and develop his own fast Fourier algorithm. The approach presented here utilizes the matrix description of fast Fourier transforms. This approach leads to a systematic method for greatly reducing the complexity and the space required by variety of signal flow graph descriptions. This reduced form is called SNOCRAFT. From this representation, it is then shown how one can derive all possible fast Fourier transform algorithms, including the Weinograd Fourier transform algorithm. It is also shown from the SNOCRAFT representation that one can easily compute the number of multiplications and additions required to perform a specified fast Fourier transform algorithm. After an elementary introduction to matrix representation of fast Fourier transform algorithm, the method of generating all possible fast Fourier transform algorithms is presented in detail and is given in three sections. The first section discusses the Generation of SNOCRAFT and the second section illustrates how Operations on SNOCRAFT are made. These operations include inversion and rotation. The last section deals with the FFT Analysis. In this section, examples are provided to illustrate how one counts the number of multiplications and additions involved in performing the transform that one has developed.

scholarly journals Application of two-dimensional fast Fourier transform algorithm, analog of the Cooley-Tukey algorithm, for 4k fixed format digital image of satellite data in frequency domain processing

2020 ◽  
Vol 149 ◽  
pp. 02010 ◽  
Author(s):  
Mikhail Noskov ◽  
Valeriy Tutatchikov
Keyword(s):  
Fourier Transform ◽  
Numerical Experiment ◽  
Fast Fourier Transform ◽  
Frequency Domain ◽  
Discrete Fourier Transform ◽  
Satellite Data ◽  
Digital Image ◽  
Digital Images ◽  
Two Dimensional ◽  
Fast Fourier Transform Algorithm

Currently, digital images in the format Full HD (1920 * 1080 pixels) and 4K (4096 * 3072) are widespread. This article will consider the option of processing a similar image in the frequency domain. As an example, take a snapshot of the earth's surface. The discrete Fourier transform will be computed using a two-dimensional analogue of the Cooley-Tukey algorithm and in a standard way by rows and columns. Let us compare the required number of operations and the results of a numerical experiment. Consider the examples of image filtering.

Sign in / Sign up

Export Citation Format

Share Document