About the Project

stable polynomials

AdvancedHelp

(0.002 seconds)

6 matching pages

1: 1.11 Zeros of Polynomials
§1.11 Zeros of Polynomials
§1.11(v) Stable Polynomials
Hurwitz Criterion
2: Bibliography S
  • I. M. Sheffer (1939) Some properties of polynomial sets of type zero. Duke Math. J. 5, pp. 590–622.
  • A. Sri Ranga (2010) Szegő polynomials from hypergeometric functions. Proc. Amer. Math. Soc. 138 (12), pp. 4259–4270.
  • A. N. Stokes (1980) A stable quotient-difference algorithm. Math. Comp. 34 (150), pp. 515–519.
  • W. F. Sun (1996) Uniform asymptotic expansions of Hermite polynomials. M. Phil. thesis, City University of Hong Kong.
  • O. Szász (1950) On the relative extrema of ultraspherical polynomials. Boll. Un. Mat. Ital. (3) 5, pp. 125–127.
  • 3: 18.40 Methods of Computation
    §18.40(i) Computation of Polynomials
    Orthogonal polynomials can be computed from their explicit polynomial form by Horner’s scheme (§1.11(i)). … … 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 …See Gautschi (1983) for examples of numerically stable and unstable use of the above recursion relations, and how one can then usefully differentiate between numerical results of low and high precision, as produced thereby. …
    4: 18.39 Applications in the Physical Sciences
    The associated Coulomb–Laguerre polynomials are defined as … 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. …
    §18.39(iv) Coulomb–Pollaczek Polynomials and J-Matrix Methods
    The Coulomb–Pollaczek Polynomials
    §18.39(v) Other Applications
    5: Bibliography G
  • M. J. Gander and A. H. Karp (2001) Stable computation of high order Gauss quadrature rules using discretization for measures in radiation transfer. J. Quant. Spectrosc. Radiat. Transfer 68 (2), pp. 213–223.
  • G. Gasper (1972) An inequality of Turán type for Jacobi polynomials. Proc. Amer. Math. Soc. 32, pp. 435–439.
  • W. Gautschi (1984) Questions of Numerical Condition Related to Polynomials. In Studies in Numerical Analysis, G. H. Golub (Ed.), pp. 140–177.
  • W. Gautschi (1996) Orthogonal Polynomials: Applications and Computation. In Acta Numerica, 1996, A. Iserles (Ed.), Acta Numerica, Vol. 5, pp. 45–119.
  • V. X. Genest, L. Vinet, and A. Zhedanov (2016) The non-symmetric Wilson polynomials are the Bannai-Ito polynomials. Proc. Amer. Math. Soc. 144 (12), pp. 5217–5226.
  • 6: 22.19 Physical Applications
    θ being the angular displacement from the point of stable equilibrium, θ = 0 . … for the initial conditions θ ( 0 ) = 0 , the point of stable equilibrium for E = 0 , and d θ ( t ) / d t = 2 E . … For an initial displacement with 1 / β | a | < 2 / β , bounded oscillations take place near one of the two points of stable equilibrium x = ± 1 / β . … Hyperelliptic functions u ( z ) are solutions of the equation z = 0 u ( f ( x ) ) 1 / 2 d x , where f ( x ) is a polynomial of degree higher than 4. …