Matematicheskoe modelirovanie
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Matem. Mod.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Matematicheskoe modelirovanie, 1990, Volume 2, Number 4, Pages 88–96 (Mi mm2357)  
Computational methods and algorithms

On parallel calculations for discrete Fourier transformation

V. A. Leus

Institute of Mathematics, Siberian Branch of USSR Academy of Sciences
Full-text PDF (1051 kB)
Abstract: The problem of asymptotic estimate of the time complexity of numerical Fourier transformation is considered. The conditions are found under which a well known estimation may be achieved. It is shown that a contradiction between FFT and DFT under these conditions is not reasonable.
Received: 25.11.1989
Bibliographic databases:
UDC: 519.687+519.712.3
Language: Russian
Citation: V. A. Leus, “On parallel calculations for discrete Fourier transformation”, Matem. Mod., 2:4 (1990), 88–96
Citation in format AMSBIB
\Bibitem{Leu90}
\by V.~A.~Leus
\paper On parallel calculations for discrete Fourier transformation
\jour Matem. Mod.
\yr 1990
\vol 2
\issue 4
\pages 88--96
\mathnet{http://mi.mathnet.ru/mm2357}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1064468}
\zmath{https://zbmath.org/?q=an:0974.65525}
Linking options:
  • https://www.mathnet.ru/eng/mm2357
  • https://www.mathnet.ru/eng/mm/v2/i4/p88
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математическое моделирование
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024