Information-based complexity
Programmer's Introduction to Visual Basic
Programmer's Introduction to Visual Basic
Time Sharing Computer Systems
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Hi-index | 0.01 |
In this survey we illustrate basic procedures and methods for application of direct and inverse operators on a composite function and for determination of periodicities. We obtain a simplified regularization of the FFT (fast Fourier transform) on a complex process. For that matter, we have introduced a direct (A) and an inverse (A 驴1) operator in the FFT and in some other complex processes, where a one-dimensional array serves as an operator. We give some correct theoretical and experimental justification of these operators and discuss a program which uses similar algorithms. We provide experimental results of a complex function after application of direct and inverse operators.