…
►
§17.7(i)
Functions
►
-Analog of Bailey’s Sum
…
►
-Analog of Gauss’s Sum
…
►
-Analog of Dixon’s Sum
…
►where
are arbitrary nonnegative integers.
…
…
►
•
Blanch and Rhodes (1955) includes , ,
, ; 8D.
The range of is 0 to 0.1, with step sizes ranging from 0.002
down to 0.00025. Notation:
,
.
►
•
Ince (1932) includes eigenvalues , , and Fourier coefficients
for or , ; 7D. Also
, for ,
, corresponding to the eigenvalues in the tables; 5D. Notation:
, .
…
►
•
Stratton et al. (1941) includes , , and the corresponding Fourier
coefficients for and for
or , . Precision is mostly 5S. Notation:
, , , and for
, see §28.1.
…
►
•
Ince (1932) includes the first zero for ,
for or , ; 4D. This reference
also gives zeros of the first derivatives, together with expansions for small
.
…
►For other tables prior to 1961 see
Fletcher et al. (1962, §2.2) and
Lebedev and Fedorova (1960, Chapter 11).
…
►
denotes the set of permutations of
.
is a one-to-one and onto mapping from
to itself.
…
►An element of
with
fixed points,
cycles of length
cycles of length
, where
, is said to have
cycle type
.
The number of elements of
with cycle type
is given by (
26.4.7).
…
►A permutation with cycle type
can be written as a product of
transpositions, and no fewer.
…
…
►with
and all allowable choices of
,
,
, and
.
…
►Let
with
and
.
…The integers
,
, and
are characteristics of the machine.
…
►
, and
…Then
rounding by chopping or
rounding down of
gives
, with maximum relative error
.
…
…
►The choice of
here is critical.
…
►Let
and
be such that
and
have opposite signs.
…We continue with
and either
or
, depending which of
and
is of opposite sign to
, and so on.
…
►Whether or not
and
have opposite signs,
is computed as in (
3.8.6).
…
►We construct sequences
and
,
, from
,
, and for
,
…