About the Project



(0.003 seconds)

1—10 of 193 matching pages

1: 7.22 Methods of Computation
§7.22 Methods of Computation
§7.22(i) Main Functions
§7.22(ii) Goodwin–Staton Integral
§7.22(iii) Repeated Integrals of the Complementary Error Function
§7.22(iv) Voigt Functions
2: 12.18 Methods of Computation
§12.18 Methods of Computation
Because PCFs are special cases of confluent hypergeometric functions, the methods of computation described in §13.29 are applicable to PCFs. …
3: 5.21 Methods of Computation
§5.21 Methods of Computation
An effective way of computing Γ ( z ) in the right half-plane is backward recurrence, beginning with a value generated from the asymptotic expansion (5.11.3). …For the left half-plane we can continue the backward recurrence or make use of the reflection formula (5.5.3). … For the computation of the q -gamma and q -beta functions see Gabutti and Allasia (2008).
4: 34.13 Methods of Computation
§34.13 Methods of Computation
Methods of computation for 3 j and 6 j symbols include recursion relations, see Schulten and Gordon (1975a), Luscombe and Luban (1998), and Edmonds (1974, pp. 42–45, 48–51, 97–99); summation of single-sum expressions for these symbols, see Varshalovich et al. (1988, §§8.2.6, 9.2.1) and Fang and Shriner (1992); evaluation of the generalized hypergeometric functions of unit argument that represent these symbols, see Srinivasa Rao and Venkatesh (1978) and Srinivasa Rao (1981). … A review of methods of computation is given in Srinivasa Rao and Rajeswari (1993, Chapter VII, pp. 235–265). …
5: Abdou Youssef
… …  1960 in Lebanon) is Professor of Computer Science in, and Former Chairman of, the Department of Computer Science at The George Washington University, Washington, D. … degrees in computer science from Princeton University. …  Scherson) of the book Interconnection Networks for High-Performance Parallel Computers, published by IEEE Computer Society Press in 1994.
6: 35.10 Methods of Computation
§35.10 Methods of Computation
See Yan (1992) for the F 1 1 and F 1 2 functions of matrix argument in the case m = 2 , and Bingham et al. (1992) for Monte Carlo simulation on 𝐎 ( m ) applied to a generalization of the integral (35.5.8). Koev and Edelman (2006) utilizes combinatorial identities for the zonal polynomials to develop computational algorithms for approximating the series expansion (35.8.1). …
7: 17.18 Methods of Computation
§17.18 Methods of Computation
For computation of the q -exponential function see Gabutti and Allasia (2008). The two main methods for computing basic hypergeometric functions are: (1) numerical summation of the defining series given in §§17.4(i) and 17.4(ii); (2) modular transformations. …
8: 31.18 Methods of Computation
§31.18 Methods of Computation
Independent solutions of (31.2.1) can be computed in the neighborhoods of singularities from their Fuchs–Frobenius expansions (§31.3), and elsewhere by numerical integration of (31.2.1). …The computation of the accessory parameter for the Heun functions is carried out via the continued-fraction equations (31.4.2) and (31.11.13) in the same way as for the Mathieu, Lamé, and spheroidal wave functions in Chapters 2830.
9: 16.25 Methods of Computation
§16.25 Methods of Computation
Methods for computing the functions of the present chapter include power series, asymptotic expansions, integral representations, differential equations, and recurrence relations. …
10: Stephen M. Watt
… …  1959 in Montreal, Canada) is Professor of Computer Science in the David R. Cheriton School of Computer Science at the University of Waterloo, where from 2015 to 2020 he also served as Dean of the Faculty of Mathematics. His areas of research include algorithms and systems for computer algebra, programming languages and compilers, mathematical handwriting recognition and mathematical document analysis. He was one of the original authors of the Maple and Axiom computer algebra systems, principal architect of the Aldor programming language and its compiler at IBM Research, and co-author of the MathML and InkML W3C standards. …