ALGORITHM FOR COMPUTING FOURIER INTEGRALS RAPIDLY

被引：0
|
作者：
MURRILL, PW
PIKE, RW
SMITH, CL
机构：
来源：
CHEMICAL ENGINEERING | 1969年 / 76卷 / 18期
关键词：
D O I：
暂无
中图分类号：
TQ [化学工业];
学科分类号：
0817 ;
摘要：
引用
收藏
页码：125 / +
页数：1
相关论文
共 50 条
  • [1] Rapidly growing Fourier integrals
    Talvila, E
    [J]. AMERICAN MATHEMATICAL MONTHLY, 2001, 108 (07): : 636 - 641
  • [2] Efficient algorithm for computing Einstein integrals
    Guo, J
    Julien, PY
    [J]. JOURNAL OF HYDRAULIC ENGINEERING, 2004, 130 (12) : 1198 - 1201
  • [3] On a Fast Algorithm for Computing the Fourier Transform
    A. A. Aleksashkina
    A. N. Kostromin
    Yu. V. Nesterenko
    [J]. Moscow University Mathematics Bulletin, 2021, 76 : 123 - 128
  • [4] On a Fast Algorithm for Computing the Fourier Transform
    Aleksashkina, A. A.
    Kostromin, A. N.
    Nesterenko, Yu, V
    [J]. MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2021, 76 (03) : 123 - 128
  • [5] An Algorithm of Computing Inhomogeneous Differential Equations for Definite Integrals
    Nakayama, Hiromasa
    Nishiyama, Kenta
    [J]. MATHEMATICAL SOFTWARE - ICMS 2010, 2010, 6327 : 221 - +
  • [6] AN ALGORITHM OF COMPUTING COHOMOLOGY INTERSECTION NUMBER OF HYPERGEOMETRIC INTEGRALS
    Matsubara-Heo, Saiei-Jaeyeong
    Takayama, Nobuki
    [J]. NAGOYA MATHEMATICAL JOURNAL, 2022, 246 : 256 - 272
  • [7] Fast algorithm for computing nonuniform Fourier transform
    Xiao, YC
    Wei, P
    Tai, HM
    [J]. CHINESE JOURNAL OF ELECTRONICS, 2006, 15 (01): : 117 - 119
  • [8] Algorithm for computing the Fourier descriptors of a binary outline
    Purcaru, D
    [J]. MELECON '98 - 9TH MEDITERRANEAN ELECTROTECHNICAL CONFERENCE, VOLS 1 AND 2, 1998, : 39 - 43
  • [9] OPTIMAL ALGORITHM FOR COMPUTING FOURIER TEXTURE DESCRIPTORS
    TANIMOTO, SL
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1978, 27 (01) : 81 - 84
  • [10] A Novel Algorithm for Computing Nonuniform Fourier Transform
    Gan Lu
    Wei Ping
    Li Wanchun
    [J]. ICSP: 2008 9TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, VOLS 1-5, PROCEEDINGS, 2008, : 292 - 295
12345