Kovacic%20algorithm

SearchAdvancedHelp

(0.002 seconds)

1—10 of 169 matching pages

1: 31.14 General Fuchsian Equation

… ►

§31.14(ii) Kovacic’s Algorithm

►An algorithm given in Kovacic (1986) determines if a given (not necessarily Fuchsian) second-order homogeneous linear differential equation with rational coefficients has solutions expressible in finite terms (Liouvillean solutions). The algorithm returns a list of solutions if they exist. ►For applications of Kovacic’s algorithm in spatio-temporal dynamics see Rod and Sleeman (1995).

2: 31.8 Solutions via Quadratures

… ►For more details see Smirnov (2002). ►The solutions in this section are finite-term Liouvillean solutions which can be constructed via Kovacic’s algorithm; see §31.14(ii).

3: Bibliography K

… ►

Linear convergence and the bisection algorithm. Amer. Math. Monthly 93 (1), pp. 48–51.

ⓘ

External Links:

ISSN 0002-9890, FullText, MathReview (J. G. Herriot), ZentralBlatt

Referenced by:

§3.8(iii).

Encodings:

BibTeX

… ►

Algorithm 737: INTLIB: A portable Fortran 77 interval standard-function library. ACM Trans. Math. Software 20 (4), pp. 447–459.

ⓘ

External Links:

ISSN 0098-3500, Document, GAMS (module 737; package TOMS), ZentralBlatt

Referenced by:

1st item.

Encodings:

BibTeX

… ►

Algorithm 327: Dilogarithm [S22]. Comm. ACM 11 (4), pp. 270–271.

ⓘ

Notes:

Includes Algol program, maximum accuracy 12D.

External Links:

ISSN 0001-0782, Document

Referenced by:

§25.21(v).

Encodings:

BibTeX

… ►

An algorithm for solving second order linear homogeneous differential equations. J. Symbolic Comput. 2 (1), pp. 3–43.

ⓘ

External Links:

ISSN 0747-7171, MathReview, ZentralBlatt

Referenced by:

§31.14(ii).

Encodings:

BibTeX

… ►

Algorithm 421. Complex gamma function with error control. Comm. ACM 15 (4), pp. 271–272.

ⓘ

External Links:

ISSN 0001-0782, Document

Referenced by:

§5.24(iv).

Encodings:

BibTeX

…

4: 20 Theta Functions

Chapter 20 Theta Functions

…

5: Bibliography G

… ►

Algorithm 292: Regular Coulomb wave functions. Comm. ACM 9 (11), pp. 793–795.

ⓘ

External Links:

ISSN 0001-0782, Document

Referenced by:

§33.26(ii).

Encodings:

BibTeX

… ►

Algorithm 471: Exponential integrals. Comm. ACM 16 (12), pp. 761–763.

ⓘ

Notes:

Includes Algol60 program, maximum accuracy 10S.

External Links:

ISSN 0001-0782, Document

Referenced by:

§6.21(ii), §8.28(vi).

Encodings:

BibTeX

… ►

Algorithm 542: Incomplete gamma functions. ACM Trans. Math. Software 5 (4), pp. 482–489.

ⓘ

Notes:

Single-precision Fortran.

External Links:

ISSN 0098-3500, Document, GAMS (module 542; package TOMS), ZentralBlatt

Referenced by:

2nd item.

Encodings:

BibTeX

►

Algorithm 726: ORTHPOL — a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules. ACM Trans. Math. Software 20 (1), pp. 21–62.

ⓘ

Notes:

For remark see same journal 24(1998), p. 355.

External Links:

Document, ISSN 0098-3500, GAMS (module 726; package TOMS), ZentralBlatt

Referenced by:

2nd item, §3.5(v), §3.5(v).

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

…

6: 27.19 Methods of Computation: Factorization

… ►Deterministic algorithms are slow but are guaranteed to find the factorization within a known period of time. …Fermat’s algorithm is another; see Bressoud (1989, §5.1). ►Type I probabilistic algorithms include the Brent–Pollard rho algorithm (also called Monte Carlo method), the Pollard $p-1$ algorithm, and the Elliptic Curve Method (ecm). Descriptions of these algorithms are given in Crandall and Pomerance (2005, §§5.2, 5.4, and 7.4). … ►These algorithms include the Continued Fraction Algorithm (cfrac), the Multiple Polynomial Quadratic Sieve (mpqs), the General Number Field Sieve (gnfs), and the Special Number Field Sieve (snfs). …

7: 7.24 Approximations

… ►

Cody (1969) provides minimax rational approximations for $\mathrm{erf}x$ and $\mathrm{erfc}x$. The maximum relative precision is about 20S.

►

Cody (1968) gives minimax rational approximations for the Fresnel integrals (maximum relative precision 19S); for a Fortran algorithm and comments see Snyder (1993).

►

Cody et al. (1970) gives minimax rational approximations to Dawson’s integral $F\left(x\right)$ (maximum relative precision 20S–22S).

…

8: Bibliography

… ►

Algorithm 724: Program to calculate F-percentiles. ACM Trans. Math. Software 19 (4), pp. 481–483.

ⓘ

Notes:

Double-precision Fortran, maximum accuracy 13D.

External Links:

ISSN 0098-3500, Document, GAMS (module 724; package TOMS), ZentralBlatt

Referenced by:

1st item.

Encodings:

BibTeX

… ►

Algorithm 39: Areas under the normal curve. The Computer Journal 12 (2), pp. 197–198.

ⓘ

Notes:

Includes Algol program, maximum accuracy 12D.

External Links:

Document

Referenced by:

§7.25(ii).

Encodings:

BibTeX

… ►

Application of the combined nonlinear-condensation transformation to problems in statistical analysis and theoretical physics. Comput. Phys. Comm. 150 (1), pp. 1–20.

ⓘ

Notes:

Includes algorithms for Lerch’s transcendent. C and Mathematica codes by Aksenov and Jentschura are available.

External Links:

Code, Document

Referenced by:

1st item.

Encodings:

BibTeX

… ►

Algorithms for special integrals of ordinary differential equations. J. Phys. A 29 (5), pp. 973–991.

ⓘ

External Links:

ISSN 0305-4470, Document, MathReview, ZentralBlatt

Referenced by:

§32.10(i).

Encodings:

BibTeX

… ►

Algorithm 804: Subroutines for the computation of Mathieu functions of integer orders. ACM Trans. Math. Software 26 (3), pp. 408–414.

ⓘ

Notes:

Double-precision C++, minimum accuracy 14D

External Links:

ISSN 0098-3500, Document, GAMS (module 804; package TOMS)

Referenced by:

1st item, 1st item.

Encodings:

BibTeX

…

9: 35.12 Software

… ►In this section we provide links to the research literature describing the implementation of algorithms in software for the evaluation of functions described in this chapter. … ►For an algorithm to evaluate zonal polynomials, and an implementation of the algorithm in Maple by Zeilberger, see Lapointe and Vinet (1996).

10: Bibliography N

… ►

Algorithm 707: CONHYP: A numerical evaluator of the confluent hypergeometric function for complex arguments of large magnitudes. ACM Trans. Math. Software 18 (3), pp. 345–349.

ⓘ

Notes:

Double-precision Fortran, minimum accuracy 9S, maximum accuracy 13S.

External Links:

ISSN 0098-3500, Document, GAMS (module 707; package TOMS), ZentralBlatt

Referenced by:

1st item.

Encodings:

BibTeX

… ►

On an integral transform involving a class of Mathieu functions. SIAM J. Math. Anal. 20 (6), pp. 1500–1513.

ⓘ

External Links:

ISSN 0036-1410, Document, MathReview (K. C. Gupta), ZentralBlatt

Referenced by:

§28.26(ii).

Encodings:

BibTeX

… ►

Reduction and evaluation of elliptic integrals. Math. Comp. 20 (94), pp. 223–231.

ⓘ

External Links:

FullText, MathReview (I. A. Stegun), ZentralBlatt

Referenced by:

§19.37(iv).

Encodings:

BibTeX

… ►

A table of integrals of the error functions. J. Res. Nat. Bur. Standards Sect B. 73B, pp. 1–20.

ⓘ

Notes:

See for additions and corrections same journal, Sect. B 75, 149–163 (1975)

External Links:

MathReview, ZentralBlatt

Referenced by:

§7.14(iii), §7.21, §7.7(iii).

Encodings:

BibTeX

… ►

Combinatorial Algorithms. Academic Press, New York.

ⓘ

External Links:

ISBN 0-12-519250-9, MathReview (Alon Itai), ZentralBlatt

Referenced by:

§26.22.

Encodings:

BibTeX

…