# single

(0.000 seconds)

## 1—10 of 52 matching pages

##### 1: 34.13 Methods of Computation
Methods of computation for $\mathit{3j}$ and $\mathit{6j}$ 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). For $\mathit{9j}$ symbols, methods include evaluation of the single-sum series (34.6.2), see Fang and Shriner (1992); evaluation of triple-sum series, see Varshalovich et al. (1988, §10.2.1) and Srinivasa Rao et al. (1989). …
##### 3: 15.17 Mathematical Applications
In combinatorics, hypergeometric identities classify single sums of products of binomial coefficients. …
##### 5: Notices
• Master Software Index

In association with the DLMF we will provide an index of all software for the computation of special functions covered by the DLMF. It is our intention that this will become an exhaustive list of sources of software for special functions. In each case we will maintain a single link where readers can obtain more information about the listed software. We welcome requests from software authors (or distributors) for new items to list.

Note that here we will only include software with capabilities that go beyond the computation of elementary functions in standard precisions since such software is nearly universal in scientific computing environments.

• ##### 6: 3.1 Arithmetics and Error Measures
###### IEEE Standard
In the case of the normalized binary interchange formats, the representation of data for binary32 (previously single precision) ($N=32$, $p=24$, $E_{{\rm min}}=-126$, $E_{{\rm max}}=127$), binary64 (previously double precision) ($N=64$, $p=53$, $E_{{\rm min}}=-1022$, $E_{{\rm max}}=1023$) and binary128 (previously quad precision) ($N=128$, $p=113$, $E_{{\rm min}}=-16382$, $E_{{\rm max}}=16383$) are as in Figure 3.1.1. …
##### 7: Guide to Searching the DLMF
• Single-letter terms

• ##### 8: 26.13 Permutations: Cycle Notation
A transposition is a permutation that consists of a single cycle of length two. …A permutation that consists of a single cycle of length $k$ can be written as the composition of $k-1$ two-cycles (read from right to left): …
##### 9: 27.16 Cryptography
With the most efficient computer techniques devised to date (2010), factoring an 800-digit number may require billions of years on a single computer. …
##### 10: Bibliography
• D. E. Amos (1983a) Algorithm 609. A portable FORTRAN subroutine for the Bickley functions ${\rm Ki}_{n}(x)$ . ACM Trans. Math. Software 9 (4), pp. 480–493.
• D. E. Amos (1983b) Algorithm 610. A portable FORTRAN subroutine for derivatives of the psi function. ACM Trans. Math. Software 9 (4), pp. 494–502.
• D. E. Amos (1986) Algorithm 644: A portable package for Bessel functions of a complex argument and nonnegative order. ACM Trans. Math. Software 12 (3), pp. 265–273.
• D. E. Amos (1980a) Algorithm 556: Exponential integrals. ACM Trans. Math. Software 6 (3), pp. 420–428.
• W. L. Anderson (1982) Algorithm 588. Fast Hankel transforms using related and lagged convolutions. ACM Trans. Math. Software 8 (4), pp. 369–370.