computation%20by%20recursion

SearchAdvancedHelp

(0.002 seconds)

6 matching pages

1: 6.20 Approximations

… ►

Cody and Thacher (1968) provides minimax rational approximations for $E_1\left(x\right)$, with accuracies up to 20S.

►

Cody and Thacher (1969) provides minimax rational approximations for $\mathrm{Ei}\left(x\right)$, with accuracies up to 20S.

►

MacLeod (1996b) provides rational approximations for the sine and cosine integrals and for the auxiliary functions $\mathrm{f}$ and $\mathrm{g}$, with accuracies up to 20S.

… ►

Luke (1969b, p. 25) gives a Chebyshev expansion near infinity for the confluent hypergeometric $U$-function (§13.2(i)) from which Chebyshev expansions near infinity for $E_1\left(z\right)$, $\mathrm{f}\left(z\right)$, and $\mathrm{g}\left(z\right)$ follow by using (6.11.2) and (6.11.3). Luke also includes a recursion scheme for computing the coefficients in the expansions of the $U$ functions. If the scheme can be used in backward direction.

…

2: Bibliography G

… ►

Recursive computation of the repeated integrals of the error function. Math. Comp. 15 (75), pp. 227–232.

ⓘ

External Links:

FullText, MathReview (J. C. P. Miller), ZentralBlatt

Referenced by:

§7.22(iii).

Encodings:

BibTeX

… ►

A note on the recursive calculation of incomplete gamma functions. ACM Trans. Math. Software 25 (1), pp. 101–107.

ⓘ

External Links:

ISSN 0098-3500, Document, MathReview Entry, ZentralBlatt

Referenced by:

§8.25(v).

Encodings:

BibTeX

… ►

The ABC of hyper recursions. J. Comput. Appl. Math. 190 (1-2), pp. 270–286.

ⓘ

External Links:

ISSN 0377-0427, Document, MathReview Entry, ZentralBlatt

Referenced by:

§15.19(iv).

Encodings:

BibTeX

… ►

Numerically satisfactory solutions of hypergeometric recursions. Math. Comp. 76 (259), pp. 1449–1468.

ⓘ

External Links:

ISSN 0025-5718, FullText, Document, MathReview Entry, ZentralBlatt

Referenced by:

§15.19(iv).

Encodings:

BibTeX

… ►

Algorithm 939: computation of the Marcum Q-function. ACM Trans. Math. Softw. 40 (3), pp. 20:1–20:21.

ⓘ

Notes:

Includes Fortran program claiming 12S accuracy

External Links:

ISSN 0098-3500, Link, Document, MathReview Entry, ZentralBlatt

Referenced by:

3rd item, §10.77(ix).

Encodings:

BibTeX

…

3: Bibliography M

… ►

Computation of inhomogeneous Airy functions. J. Comput. Appl. Math. 53 (1), pp. 109–116.

ⓘ

External Links:

ISSN 0377-0427, Document, MathReview (Dumitru Acu), ZentralBlatt

Referenced by:

1st item.

Encodings:

BibTeX

… ►

The efficient computation of some generalised exponential integrals. J. Comput. Appl. Math. 148 (2), pp. 363–374.

ⓘ

External Links:

ISSN 0377-0427, Document, MathReview, ZentralBlatt

Referenced by:

§8.19(v).

Encodings:

BibTeX

… ►

The computation of elementary functions in radix $2^p$ . Computing 53 (3-4), pp. 219–232.

ⓘ

Notes:

International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (Vienna, 1993)

External Links:

ISSN 0010-485X, Document, MathReview, ZentralBlatt

Referenced by:

§4.45(i).

Encodings:

BibTeX

… ►

Recursion relations for the $3$-$j$ symbols. Nuclear Physics A 113 (1), pp. 215–220.

ⓘ

External Links:

Document

Referenced by:

§34.3(iii).

Encodings:

BibTeX

… ►

The $q$-analogue of the Laguerre polynomials. J. Math. Anal. Appl. 81 (1), pp. 20–47.

ⓘ

External Links:

ISSN 0022-247X, Document, MathReview (R. A. Askey), ZentralBlatt

Referenced by:

§18.27(v).

Encodings:

BibTeX

…

4: Bibliography F

… ►

ⓘ

Notes:

The “Freely Distributable LIBM” package provides implementations of standard elementary functions plus a few higher functions, e.g. gamma. Double precision, maximum accuracy 20S. Developed by Sun Microsystems.

External Links:

GAMS (package FDLIBM)

Referenced by:

§ ‣ Software Cross Index, § ‣ Software Cross Index.

Encodings:

BibTeX

… ►

Sur certaines sommes des intégral-cosinus. Bull. Soc. Math. Phys. Serbie 12, pp. 13–20 (French).

ⓘ

External Links:

MathReview (L. Carlitz), ZentralBlatt

Referenced by:

§6.15.

Encodings:

BibTeX

… ►

Faster computation of Bernoulli numbers. J. Algorithms 13 (3), pp. 431–445.

ⓘ

External Links:

ISSN 0196-6774, MathReview (P. K. Subramanian), ZentralBlatt

Referenced by:

§24.19(i).

Encodings:

BibTeX

… ►

On weighted polynomial approximation on the whole real axis. Acta Math. Acad. Sci. Hungar. 20, pp. 223–225.

ⓘ

External Links:

ISSN 0001-5954, Document, Link, MathReview (A. K. Varma)

Referenced by:

§18.32.

Encodings:

BibTeX

►

On the coefficients in the recursion formulae of orthogonal polynomials. Proc. Roy. Irish Acad. Sect. A 76 (1), pp. 1–6.

ⓘ

External Links:

MathReview (A. G. Law), ZentralBlatt

Referenced by:

§18.32, §32.15.

Encodings:

BibTeX

…

5: 18.40 Methods of Computation

§18.40 Methods of Computation

►

§18.40(i) Computation of Polynomials

… ►

A numerical approach to the recursion coefficients and quadrature abscissas and weights

… ►A simple set of choices is spelled out in Gordon (1968) which gives a numerically stable algorithm for direct computation of the recursion coefficients in terms of the moments, followed by construction of the J-matrix and quadrature weights and abscissas, and we will follow this approach: Let $N$ be a positive integer and define …and these can be used for the recursion coefficients …

6: 18.39 Applications in the Physical Sciences

… ►The discrete variable representations (DVR) analysis is simplest when based on the classical OP’s with their analytically known recursion coefficients (Table 3.5.17_5), or those non-classical OP’s which have analytically known recursion coefficients, making stable computation of the $x_i$ and $w_i$, from the J-matrix as in §3.5(vi), straightforward. …Table 18.39.1 lists typical non-classical weight functions, many related to the non-classical Freud weights of §18.32, and §32.15, all of which require numerical computation of the recursion coefficients (i. … ►Following the method of Schwartz (1961), Yamani and Reinhardt (1975), Bank and Ismail (1985), and Ismail (2009, §5.8)  have shown this is equivalent to determination of $x$ such that $c_N(x)=0$ in the recursion scheme …The recursion of (18.39.46) is that for the type 2 Pollaczek polynomials of (18.35.2), with $\lambda =l+1$, $a=-b=2Z/s$, and $c=0$, and terminates for $x=x_i^N$ being a zero of the polynomial of order $N$. … ►As this follows from the three term recursion of (18.39.46) it is referred to as the J-Matrix approach, see (3.5.31), to single and multi-channel scattering numerics. …