About the Project

quotient-difference algorithm

AdvancedHelp

(0.002 seconds)

21—30 of 89 matching pages

21: 29.22 Software
In this section we provide links to the research literature describing the implementation of algorithms in software for the evaluation of functions described in this chapter. …
22: 34.15 Software
In this section we provide links to the research literature describing the implementation of algorithms in software for the evaluation of functions described in this chapter. …
23: Bernard Deconinck
He has worked on integrable systems, algorithms for computations with Riemann surfaces, Bose-Einstein condensates, and methods to investigate the stability of solutions of nonlinear wave equations. …
24: Peter Paule
Paule’s main research interests are computer algebra and algorithmic mathematics, together with connections to combinatorics, special functions, number theory, and other related fields. …
25: Bibliography Z
  • M. R. Zaghloul and A. N. Ali (2011) Algorithm 916: computing the Faddeyeva and Voigt functions. ACM Trans. Math. Software 38 (2), pp. Art. 15, 22.
  • M. R. Zaghloul (2016) Remark on “Algorithm 916: computing the Faddeyeva and Voigt functions”: efficiency improvements and Fortran translation. ACM Trans. Math. Softw. 42 (3), pp. 26:1–26:9.
  • M. R. Zaghloul (2017) Algorithm 985: Simple, Efficient, and Relatively Accurate Approximation for the Evaluation of the Faddeyeva Function. ACM Trans. Math. Softw. 44 (2), pp. 22:1–22:9.
  • Zeilberger (website) Doron Zeilberger’s Maple Packages and Programs Department of Mathematics, Rutgers University, New Jersey.
  • 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).
  • 26: Bibliography T
  • N. M. Temme (1979a) An algorithm with ALGOL 60 program for the computation of the zeros of ordinary Bessel functions and those of their derivatives. J. Comput. Phys. 32 (2), pp. 270–279.
  • N. M. Temme (1994a) A set of algorithms for the incomplete gamma functions. Probab. Engrg. Inform. Sci. 8, pp. 291–307.
  • N. M. Temme (1997) Numerical algorithms for uniform Airy-type asymptotic expansions. Numer. Algorithms 15 (2), pp. 207–225.
  • H. C. Thacher Jr. (1963) Algorithm 165: Complete elliptic integrals. Comm. ACM 6 (4), pp. 163–164.
  • I. J. Thompson (2004) Erratum to “COULCC: A continued-fraction algorithm for Coulomb functions of complex order with complex arguments”. Comput. Phys. Comm. 159 (3), pp. 241–242.
  • 27: 8.25 Methods of Computation
    DiDonato and Morris (1986) describes an algorithm for computing P ( a , x ) and Q ( a , x ) for a 0 , x 0 , and a + x 0 from the uniform expansions in §8.12. The algorithm supplies 14S accuracy. …
    28: 15.20 Software
    In this section we provide links to the research literature describing the implementation of algorithms in software for the evaluation of functions described in this chapter. …
    29: 27.22 Software
  • Wolfram’s Mathworld. Descriptions, references, and Mathematica algorithms for factorization and primality testing.

  • 30: 28.36 Software
    In this section we provide links to the research literature describing the implementation of algorithms in software for the evaluation of functions described in this chapter. …