About the Project

gam%C3%A9%20polynomials

AdvancedHelp

(0.003 seconds)

1—10 of 333 matching pages

1: 31.5 Solutions Analytic at Three Singularities: Heun Polynomials
§31.5 Solutions Analytic at Three Singularities: Heun Polynomials
31.5.2 𝐻𝑝 n , m ( a , q n , m ; n , β , γ , δ ; z ) = H ( a , q n , m ; n , β , γ , δ ; z )
is a polynomial of degree n , and hence a solution of (31.2.1) that is analytic at all three finite singularities 0 , 1 , a . These solutions are the Heun polynomials. …
2: 35.4 Partitions and Zonal Polynomials
§35.4 Partitions and Zonal Polynomials
Normalization
Orthogonal Invariance
Summation
Mean-Value
3: 24.1 Special Notation
Bernoulli Numbers and Polynomials
The origin of the notation B n , B n ( x ) , is not clear. …
Euler Numbers and Polynomials
The notations E n , E n ( x ) , as defined in §24.2(ii), were used in Lucas (1891) and Nörlund (1924). …
4: 18.3 Definitions
§18.3 Definitions
For expressions of ultraspherical, Chebyshev, and Legendre polynomials in terms of Jacobi polynomials, see §18.7(i). …For explicit power series coefficients up to n = 12 for these polynomials and for coefficients up to n = 6 for Jacobi and ultraspherical polynomials see Abramowitz and Stegun (1964, pp. 793–801). …
Bessel polynomials
Bessel polynomials are often included among the classical OP’s. …
5: 18.42 Software
For another listing of Web-accessible software for the functions in this chapter, see GAMS (class C3).
  • CAOP (website). Computer Algebra and Orthogonal Polynomials.

  • 6: 22.22 Software
    For another listing of Web-accessible software for the functions in this chapter, see GAMS (class C13). …
    7: Bibliography
  • R. W. Abernathy and R. P. Smith (1993) Algorithm 724: Program to calculate F-percentiles. ACM Trans. Math. Software 19 (4), pp. 481–483.
  • F. A. Alhargan (2000) Algorithm 804: Subroutines for the computation of Mathieu functions of integer orders. ACM Trans. Math. Software 26 (3), pp. 408–414.
  • 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 (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.
  • 8: Bibliography G
  • W. Gautschi (1977b) Algorithm 521: Repeated integrals of the coerror function. ACM Trans. Math. Software 3, pp. 301–302.
  • W. Gautschi (1979a) Algorithm 542: Incomplete gamma functions. ACM Trans. Math. Software 5 (4), pp. 482–489.
  • W. Gautschi (1994) 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.
  • A. Gil, J. Segura, and N. M. Temme (2004a) Algorithm 831: Modified Bessel functions of imaginary order and positive argument. ACM Trans. Math. Software 30 (2), pp. 159–164.
  • M. Goano (1995) Algorithm 745: Computation of the complete and incomplete Fermi-Dirac integral. ACM Trans. Math. Software 21 (3), pp. 221–232.
  • 9: 16.27 Software
    For another listing of Web-accessible software for the functions in this chapter, see GAMS (class C19). …
    10: 23.24 Software
    For another listing of Web-accessible software for the functions in this chapter, see GAMS (class C15). …