Abstract
In this paper, fast evaluation of Fourier integrals using additive and dual additive algorithms are considered. For this, we introduce formulas for fast computing Fourier integrals and we present possible variants of structural realization of spectral analyzer. Computer simulation of additive algorithms for solving differential equations is described. The algorithms presented in this paper are suitable for real-time analysis.
Similar content being viewed by others
References
Muller, D. E.: Infinite sequences and finite machines, Proc. Fourth Ann. IEEE Sympos. Switch, Circuit Theory Log. Design. S-156 (1963), 9–16.
Borkovsky, B. A., Katkov, A. F. and Romanthov, V. P.: The additive formulas of discrete Fourier transformation, Math. Model. Theory Electr. Circuits 14 (1976), 80–84.
Borkovsky, B. A.: The additive fourier transformation, Math. Model. Theory Electr. Circuits 16 (1978), 47–53.
Katkov, A. F.: The dual formulas the additive fourier transformation, Math.Model. Theory Electr. Circuits 16 (1978), 53–59.
Katkov, A. F. and Goubarieni, N.: Self-organizing computational processes in network with speed independent functional elements, In: Proc. European Simulation Multiconference, SCS Publication, Budapest, Hungary, 1996, pp. 707–711.
Sezan, M. I. and Stark, H.: Tomographic image reconstruction from incomplete view data by convex projections and direct fourier inversion, IEEE Trans. Med. Imag. MI-3 (1984), 91–98.
Tam, K. C. and Perez-Mendez, V.: Limited angle three dimensional reconstructions using Fourier transform iterations and radon transform iterations, Optim. Engrg. 20 (1981), 585–589.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Katkov, A., Wegrzyn-Skrzypczak, E. Speedy Numerical Algorithms and Architecture for Additive Spectral Analysis. Journal of Mathematical Modelling and Algorithms 1, 225–241 (2002). https://doi.org/10.1023/A:1020594607281
Issue Date:
DOI: https://doi.org/10.1023/A:1020594607281