About the Project

numerator polynomials

AdvancedHelp

(0.002 seconds)

1—10 of 63 matching pages

1: 18.30 Associated OP’s
Numerator and Denominator Polynomials
The p n ( 0 ) ( x ) are also referred to as the numerator polynomials, the p n ( x ) then being the denominator polynomials, in that the n -th approximant of the continued fraction, z , …
Markov’s Theorem
The ratio p n ( 0 ) ( z ) / p n ( z ) , as defined here, thus provides the same statement of Markov’s Theorem, as in (18.2.9_5), but now in terms of differently obtained numerator and denominator polynomials. …
2: Bibliography I
  • M. E. H. Ismail (2000b) More on electrostatic models for zeros of orthogonal polynomials. Numer. Funct. Anal. Optim. 21 (1-2), pp. 191–204.
  • 3: 18.2 General Orthogonal Polynomials
    Because of (18.2.36) the OP’s p n ( x ) are also called monic denominator polynomials and the OP’s p n 1 ( 1 ) ( x ) , or, equivalently, the p n ( 0 ) ( x ) , are called the monic numerator polynomials. …
    4: Bibliography G
  • B. Gabutti and B. Minetti (1981) A new application of the discrete Laguerre polynomials in the numerical evaluation of the Hankel transform of a strongly decreasing even function. J. Comput. Phys. 42 (2), pp. 277–287.
  • W. Gautschi (1984) Questions of Numerical Condition Related to Polynomials. In Studies in Numerical Analysis, G. H. Golub (Ed.), pp. 140–177.
  • W. Gautschi (1992) On mean convergence of extended Lagrange interpolation. J. Comput. Appl. Math. 43 (1-2), pp. 19–35.
  • W. Gautschi (2004) Orthogonal Polynomials: Computation and Approximation. Numerical Mathematics and Scientific Computation, Oxford University Press, New York.
  • W. Gautschi (2009) Variable-precision recurrence coefficients for nonstandard orthogonal polynomials. Numer. Algorithms 52 (3), pp. 409–418.
  • 5: 18.38 Mathematical Applications
    §18.38(i) Classical OP’s: Numerical Analysis
    Differential Equations: Spectral Methods
    Quadrature “Extended” to Pseudo-Spectral (DVR) Representations of Operators in One and Many Dimensions
    6: Bibliography F
  • L. Fox and I. B. Parker (1968) Chebyshev Polynomials in Numerical Analysis. Oxford University Press, London.
  • 7: 29.21 Tables
  • Arscott and Khabaza (1962) tabulates the coefficients of the polynomials P in Table 29.12.1 (normalized so that the numerically largest coefficient is unity, i.e. monic polynomials), and the corresponding eigenvalues h for k 2 = 0.1 ( .1 ) 0.9 , n = 1 ( 1 ) 30 . Equations from §29.6 can be used to transform to the normalization adopted in this chapter. Precision is 6S.

  • 8: Bibliography S
  • H. E. Salzer (1955) Orthogonal polynomials arising in the numerical evaluation of inverse Laplace transforms. Math. Tables Aids Comput. 9 (52), pp. 164–177.
  • J. Segura and A. Gil (1999) Evaluation of associated Legendre functions off the cut and parabolic cylinder functions. Electron. Trans. Numer. Anal. 9, pp. 137–146.
  • 9: Bibliography C
  • J. M. Carnicer, E. Mainar, and J. M. Peña (2020) Stability properties of disk polynomials. Numer. Algorithms.
  • 10: Bibliography L
  • J. L. López and N. M. Temme (2010a) Asymptotics and numerics of polynomials used in Tricomi and Buchholz expansions of Kummer functions. Numer. Math. 116 (2), pp. 269–289.