About the Project

fast

AdvancedHelp

(0.001 seconds)

1—10 of 25 matching pages

1: Barry I. Schneider
Recently he has served as Co-Chair of the US government Fast Track Action Committee to update the US strategic computing plan.
2: Bibliography Z
  • Ya. M. Zhileĭkin and A. B. Kukarkin (1995) A fast Fourier-Bessel transform algorithm. Zh. Vychisl. Mat. i Mat. Fiz. 35 (7), pp. 1128–1133 (Russian).
  • A. Ziv (1991) Fast evaluation of elementary mathematical functions with correctly rounded last bit. ACM Trans. Math. Software 17 (3), pp. 410–423.
  • 3: 15.19 Methods of Computation
    For fast computation of F ( a , b ; c ; z ) with a , b and c complex, and with application to Pöschl–Teller–Ginocchio potential wave functions, see Michel and Stoitsov (2008). … As noted in §3.7(ii), the integration path should be chosen so that the wanted solution grows in magnitude at least as fast as all other solutions. …
    4: 9.17 Methods of Computation
    As described in §3.7(ii), to ensure stability the integration path must be chosen in such a way that as we proceed along it the wanted solution grows at least as fast as all other solutions of the differential equation. …
    5: 3.11 Approximation Techniques
    The Fast Fourier Transform
    The method of the fast Fourier transform (FFT) exploits the structure of the matrix 𝛀 with elements ω n j k , j , k = 0 , 1 , , n 1 . …
    6: Bibliography H
  • N. Hale and A. Townsend (2016) A fast FFT-based discrete Legendre transform. IMA J. Numer. Anal. 36 (4), pp. 1670–1684.
  • E. W. Hansen (1985) Fast Hankel transform algorithm. IEEE Trans. Acoust. Speech Signal Process. 32 (3), pp. 666–671.
  • 7: Bibliography J
  • H. K. Johansen and K. Sørensen (1979) Fast Hankel transforms. Geophysical Prospecting 27 (4), pp. 876–901.
  • 8: Bibliography V
  • C. Van Loan (1992) Computational Frameworks for the Fast Fourier Transform. Frontiers in Applied Mathematics, Vol. 10, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA.
  • 9: 10.74 Methods of Computation
    As described in §3.7(ii), to insure stability the integration path must be chosen in such a way that as we proceed along it the wanted solution grows in magnitude at least as fast as all other solutions of the differential equation. …
    10: 13.29 Methods of Computation
    As described in §3.7(ii), to insure stability the integration path must be chosen in such a way that as we proceed along it the wanted solution grows in magnitude at least as fast as all other solutions of the differential equation. …