central%20differences%20in%20imaginary%20direction

(0.005 seconds)

21—30 of 953 matching pages

21: 28.35 Tables

… ►

•

Ince (1932) includes eigenvalues $a_{n}$ , $b_{n}$ , and Fourier coefficients for $n=0$ or $1(1)6$ , $q=0(1)10(2)20(4)40$ ; 7D. Also $\operatorname{ce}_{n}\left(x,q\right)$ , $\operatorname{se}_{n}\left(x,q\right)$ for $q=0(1)10$ , $x=1(1)90$ , corresponding to the eigenvalues in the tables; 5D. Notation: $a_{n}=\mathit{be}_{n}-2q$ , $b_{n}=\mathit{bo}_{n}-2q$ .

►

•

Kirkpatrick (1960) contains tables of the modified functions $\operatorname{Ce}_{n}\left(x,q\right)$ , $\operatorname{Se}_{n+1}\left(x,q\right)$ for $n=0(1)5$ , $q=1(1)20$ , $x=0.1(.1)1$ ; 4D or 5D.

►

•

National Bureau of Standards (1967) includes the eigenvalues $a_{n}\left(q\right)$ , $b_{n}\left(q\right)$ for $n=0(1)3$ with $q=0(.2)20(.5)37(1)100$ , and $n=4(1)15$ with $q=0(2)100$ ; Fourier coefficients for $\operatorname{ce}_{n}\left(x,q\right)$ and $\operatorname{se}_{n}\left(x,q\right)$ for $n=0(1)15$ , $n=1(1)15$ , respectively, and various values of $q$ in the interval $[0,100]$ ; joining factors $g_{\mathit{e},n}(\sqrt{q})$ , $f_{\mathit{e},n}(\sqrt{q})$ for $n=0(1)15$ with $q=0(.5\mbox{ to }10)100$ (but in a different notation). Also, eigenvalues for large values of $q$ . Precision is generally 8D.

… ►

•

Zhang and Jin (1996, pp. 521–532) includes the eigenvalues $a_{n}\left(q\right)$ , $b_{n+1}\left(q\right)$ for $n=0(1)4$ , $q=0(1)50$ ; $n=0(1)20$ ( $a$ ’s) or 19 ( $b$ ’s), $q=1,3,5,10,15,25,50(50)200$ . Fourier coefficients for $\operatorname{ce}_{n}\left(x,10\right)$ , $\operatorname{se}_{n+1}\left(x,10\right)$ , $n=0(1)7$ . Mathieu functions $\operatorname{ce}_{n}\left(x,10\right)$ , $\operatorname{se}_{n+1}\left(x,10\right)$ , and their first $x$ -derivatives for $n=0(1)4$ , $x=0(5^{\circ})90^{\circ}$ . Modified Mathieu functions ${\operatorname{Mc}^{(j)}_{n}}\left(x,\sqrt{10}\right)$ , ${\operatorname{Ms}^{(j)}_{n+1}}\left(x,\sqrt{10}\right)$ , and their first $x$ -derivatives for $n=0(1)4$ , $j=1,2$ , $x=0(.2)4$ . Precision is mostly 9S.

… ►

•

Zhang and Jin (1996, pp. 533–535) includes the zeros (in degrees) of $\operatorname{ce}_{n}\left(x,10\right)$ , $\operatorname{se}_{n}\left(x,10\right)$ for $n=1(1)10$ , and the first 5 zeros of ${\operatorname{Mc}^{(j)}_{n}}\left(x,\sqrt{10}\right)$ , ${\operatorname{Ms}^{(j)}_{n}}\left(x,\sqrt{10}\right)$ for $n=0$ or $1(1)8$ , $j=1,2$ . Precision is mostly 9S.

…

22: William P. Reinhardt

… ►He currently resides in Santa Fe, NM. ►Reinhardt is a theoretical chemist and atomic physicist, who has always been interested in orthogonal polynomials and in the analyticity properties of the functions of mathematical physics. … ►This is closely connected with his interests in classical dynamical “chaos,” an area where he coauthored a book, Chaos in atomic physics with Reinhold Blümel. … ►

20 Theta Functions

… ►In November 2015, Reinhardt was named Senior Associate Editor of the DLMF and Associate Editor for Chapters 20, 22, and 23.

23: Peter L. Walker

… ► 1942 in Dorchester, U. …He began his academic career in 1964 at the University of Lancaster, U. … ►Walker’s books are An Introduction to Complex Analysis, published by Hilger in 1974, The Theory of Fourier Series and Integrals, published by Wiley in 1986, Elliptic Functions. A Constructive Approach, published by Wiley in 1996, and Examples and Theorems in Analysis, published by Springer in 2004. … ►Walker is now retired and living in Cheltenham, UK. … ►

20 Theta Functions

…

24: 27.15 Chinese Remainder Theorem

… ►This theorem is employed to increase efficiency in calculating with large numbers by making use of smaller numbers in most of the calculation. …Their product

m

has 20 digits, twice the number of digits in the data. By the Chinese remainder theorem each integer in the data can be uniquely represented by its residues (mod

m_{1}

), (mod

m_{2}

), (mod

m_{3}

), and (mod

m_{4}

), respectively. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result

\pmod{m}

, which is correct to 20 digits. … ►Details of a machine program describing the method together with typical numerical results can be found in Newman (1967). …

25: 36.5 Stokes Sets

… ►In the following subsections, only Stokes sets involving at least one real saddle are included unless stated otherwise. … ►The Stokes set takes different forms for

z=0

z<0

, and

z>0

. … ►in which … ►in which … ►The distribution of real and complex critical points in Figures 36.5.5 and 36.5.6 follows from consistency with Figure 36.5.1 and the fact that there are four real saddles in the inner regions. …

26: 18.19 Hahn Class: Definitions

… ►The Askey scheme extends the three families of classical OP’s (Jacobi, Laguerre and Hermite) with eight further families of OP’s for which the role of the differentiation operator

\frac{\mathrm{d}}{\mathrm{d}x}

in the case of the classical OP’s is played by a suitable difference operator. These eight further families can be grouped in two classes of OP’s: ►

Hahn class (or linear lattice class). These are OP’s $p_{n}(x)$ where the role of $\frac{\mathrm{d}}{\mathrm{d}x}$ is played by $\Delta_{x}$ or $\nabla_{x}$ or $\delta_{x}$ (see §18.1(i) for the definition of these operators). The Hahn class consists of four discrete and two continuous families.

►

Wilson class (or quadratic lattice class). These are OP’s $p_{n}(x)=p_{n}(\lambda(y))$ ( $p_{n}(x)$ of degree $n$ in $x$ , $\lambda(y)$ quadratic in $y$ ) where the role of the differentiation operator is played by $\tfrac{\Delta_{y}}{\Delta_{y}(\lambda(y))}$ or $\tfrac{\nabla_{y}}{\nabla_{y}(\lambda(y))}$ or $\tfrac{\delta_{y}}{\delta_{y}(\lambda(y))}$ . The Wilson class consists of two discrete and two continuous families.

►In addition to the limit relations in §18.7(iii) there are limit relations involving the further families in the Askey scheme, see §§18.21(ii) and 18.26(ii). …

27: 3.8 Nonlinear Equations

… ►Results appear in Table 3.8.1. … ►has

n

zeros in

\mathbb{C}

, counting each zero according to its multiplicity. … ►Consider

x=20

and

j=19

. We have

p^{\mspace{1.0mu}\prime}(20)=19!

and

a_{19}=1+2+\dots+20=210

. … ►Starting this iteration in the neighborhood of one of the four zeros

\pm 1,\pm\mathrm{i}

, sequences

\{z_{n}\}

are generated that converge to these zeros. …

28: 33.24 Tables

… ►

•

Abramowitz and Stegun (1964, Chapter 14) tabulates $F_{0}\left(\eta,\rho\right)$ , $G_{0}\left(\eta,\rho\right)$ , $F_{0}'\left(\eta,\rho\right)$ , and $G_{0}'\left(\eta,\rho\right)$ for $\eta=0.5(.5)20$ and $\rho=1(1)20$ , 5S; $C_{0}\left(\eta\right)$ for $\eta=0(.05)3$ , 6S.

…

29: 10.75 Tables

… ►

•

Achenbach (1986) tabulates $J_{0}\left(x\right)$ , $J_{1}\left(x\right)$ , $Y_{0}\left(x\right)$ , $Y_{1}\left(x\right)$ , $x=0(.1)8$ , 20D or 18–20S.

… ►

•

Bickley et al. (1952) tabulates $x^{-n}I_{n}\left(x\right)$ or $e^{-x}I_{n}\left(x\right)$ , $x^{n}K_{n}\left(x\right)$ or $e^{x}K_{n}\left(x\right)$ , $n=2(1)20$ , $x=0$ (.01 or .1) 10(.1) 20, 8S; $I_{n}\left(x\right)$ , $K_{n}\left(x\right)$ , $n=0(1)20$ , $x=0$ or $0.1(.1)20$ , 10S.

… ►

•

Kerimov and Skorokhodov (1984b) tabulates all zeros of the principal values of $K_{n}\left(z\right)$ and $K_{n}'\left(z\right)$ , for $n=2(1)20$ , 9S.

►

•

Kerimov and Skorokhodov (1984c) tabulates all zeros of $I_{-n-\frac{1}{2}}\left(z\right)$ and $I_{-n-\frac{1}{2}}'\left(z\right)$ in the sector $0\leq\operatorname{ph}z\leq\tfrac{1}{2}\pi$ for $n=1(1)20$ , 9S.

… ►

•

Zhang and Jin (1996, p. 322) tabulates $\operatorname{ber}x$ , $\operatorname{ber}'x$ , $\operatorname{bei}x$ , $\operatorname{bei}'x$ , $\operatorname{ker}x$ , $\operatorname{ker}'x$ , $\operatorname{kei}x$ , $\operatorname{kei}'x$ , $x=0(1)20$ , 7S.

…

30: 26.10 Integer Partitions: Other Restrictions

… ►

p\left(\mathcal{D}k,n\right)

denotes the number of partitions of

n

into parts with difference at least

k

p\left(\mathcal{D}^{\prime}3,n\right)

denotes the number of partitions of

n

into parts with difference at least 3, except that multiples of 3 must differ by at least 6. …

p\left(\in\!S,n\right)

denotes the number of partitions of

n

into parts taken from the set

S

. … ►In exact analogy with (26.9.8), we have … ►where the inner sum is the sum of all positive divisors of

t

that are in

S

. …