via non-classical orthogonal polynomials
(0.003 seconds)
11—20 of 338 matching pages
11: 35.12 Software
…
►Citations in the bulleted list refer to papers for which research software has been made available and can be downloaded via the Web.
…
►
•
…
►
•
►For an algorithm to evaluate zonal polynomials, and an implementation of the algorithm in Maple by Zeilberger, see Lapointe and Vinet (1996).
Demmel and Koev (2006). Computation of zonal polynomials in MATLAB.
Stembridge (1995). Maple software for zonal polynomials.
12: Bibliography I
…
►
On polynomials orthogonal with respect to certain Sobolev inner products.
J. Approx. Theory 65 (2), pp. 151–175.
…
►
Two families of orthogonal polynomials related to Jacobi polynomials.
Rocky Mountain J. Math. 21 (1), pp. 359–375.
…
►
An electrostatics model for zeros of general orthogonal polynomials.
Pacific J. Math. 193 (2), pp. 355–369.
…
►
Classical and Quantum Orthogonal Polynomials in One Variable.
Encyclopedia of Mathematics and its Applications, Vol. 98, Cambridge University Press, Cambridge.
…
►
On the asymptotic analysis of the Painlevé equations via the isomonodromy method.
Nonlinearity 7 (5), pp. 1291–1325.
…
13: 24.21 Software
…
►Citations in the bulleted list refer to papers for which research software has been made available and can be downloaded via the Web.
…
►
§24.21(ii) , , , and
…14: 18.19 Hahn Class: Definitions
§18.19 Hahn Class: Definitions
… ►Hahn, Krawtchouk, Meixner, and Charlier
►Tables 18.19.1 and 18.19.2 provide definitions via orthogonality and standardization (§§18.2(i), 18.2(iii)) for the Hahn polynomials , Krawtchouk polynomials , Meixner polynomials , and Charlier polynomials . … ►These polynomials are orthogonal on , and are defined as follows. …A special case of (18.19.8) is .15: 21.10 Methods of Computation
…
►
•
►
•
…
Tretkoff and Tretkoff (1984). Here a Hurwitz system is chosen to represent the Riemann surface.
16: 18.30 Associated OP’s
…
►
§18.30(vi) Corecursive Orthogonal Polynomials
… ►Numerator and Denominator Polynomials
… ►§18.30(vii) Corecursive and Associated Monic Orthogonal Polynomials
►Defining associated orthogonal polynomials and their relationship to their corecursive counterparts is particularly simple via use of the recursion relations for the monic, rather than via those for the traditional polynomials. … ►17: 18.40 Methods of Computation
…
►Orthogonal polynomials can be computed from their explicit polynomial form by Horner’s scheme (§1.11(i)).
…
►
Stieltjes Inversion via (approximate) Analytic Continuation
… ►The bottom and top of the steps at the are lower and upper bounds to as made explicit via the Chebyshev inequalities discussed by Shohat and Tamarkin (1970, pp. 42–43). … ►In what follows this is accomplished in two ways: i) via the Lagrange interpolation of §3.3(i) ; and ii) by constructing a pointwise continued fraction, or PWCF, as follows: …where the coefficients are defined recursively via , and …18: 22.18 Mathematical Applications
…
►
§22.18(i) Lengths and Parametrization of Plane Curves
… ►§22.18(iii) Uniformization and Other Parametrizations
… ► … ►Algebraic curves of the form , where is a nonsingular polynomial of degree 3 or 4 (see McKean and Moll (1999, §1.10)), are elliptic curves, which are also considered in §23.20(ii). …The existence of this group structure is connected to the Jacobian elliptic functions via the differential equation (22.13.1). …19: 10.59 Integrals
20: 31.8 Solutions via Quadratures
§31.8 Solutions via Quadratures
… ►
31.8.2
…
►Here is a polynomial of degree in and of degree in , that is a solution of the third-order differential equation satisfied by a product of any two solutions of Heun’s equation.
…
►When approaches the ends of the gaps, the solution (31.8.2) becomes the corresponding Heun polynomial.
…
►The solutions in this section are finite-term Liouvillean solutions which can be constructed via Kovacic’s algorithm; see §31.14(ii).