About the Project

Bairstow method (for zeros of polynomials)

AdvancedHelp

(0.004 seconds)

1—10 of 417 matching pages

1: 35.4 Partitions and Zonal Polynomials
§35.4 Partitions and Zonal Polynomials
Normalization
Orthogonal Invariance
Summation
Mean-Value
2: 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. …
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 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). … In addition to the orthogonal property given by Table 18.3.1, the Chebyshev polynomials T n ( x ) , n = 0 , 1 , , N , are orthogonal on the discrete point set comprising the zeros x N + 1 , n , n = 1 , 2 , , N + 1 , of T N + 1 ( x ) : …
Bessel polynomials
Bessel polynomials are often included among the classical OP’s. …
5: 3.8 Nonlinear Equations
§3.8 Nonlinear Equations
Bisection Method
Secant Method
Eigenvalue Methods
Bairstow’s Method
6: 29.20 Methods of Computation
§29.20 Methods of Computation
A fourth method is by asymptotic approximations by zeros of orthogonal polynomials of increasing degree. … The eigenvalues corresponding to Lamé polynomials are computed from eigenvalues of the finite tridiagonal matrices 𝐌 given in §29.15(i), using methods described in §3.2(vi) and Ritter (1998). …
§29.20(iii) Zeros
Zeros of Lamé polynomials can be computed by solving the system of equations (29.12.13) by employing Newton’s method; see §3.8(ii). …
7: Bibliography I
  • L. Infeld and T. E. Hull (1951) The factorization method. Rev. Modern Phys. 23 (1), pp. 21–68.
  • M. E. H. Ismail and M. E. Muldoon (1995) Bounds for the small real and purely imaginary zeros of Bessel and related functions. Methods Appl. Anal. 2 (1), pp. 1–21.
  • M. E. H. Ismail (2000a) An electrostatics model for zeros of general orthogonal polynomials. Pacific J. Math. 193 (2), pp. 355–369.
  • M. E. H. Ismail (2000b) More on electrostatic models for zeros of orthogonal polynomials. Numer. Funct. Anal. Optim. 21 (1-2), pp. 191–204.
  • M. E. H. Ismail and X. Li (1992) Bound on the extreme zeros of orthogonal polynomials. Proc. Amer. Math. Soc. 115 (1), pp. 131–140.
  • 8: Bibliography Q
  • W. Qiu and R. Wong (2004) Asymptotic expansion of the Krawtchouk polynomials and their zeros. Comput. Methods Funct. Theory 4 (1), pp. 189–226.
  • C. K. Qu and R. Wong (1999) “Best possible” upper and lower bounds for the zeros of the Bessel function J ν ( x ) . Trans. Amer. Math. Soc. 351 (7), pp. 2833–2859.
  • C. Quesne (2011) Higher-Order SUSY, Exactly Solvable Potentials, and Exceptional Orthogonal Polynomials. Modern Physics Letters A 26, pp. 1843–1852.
  • 9: 1.11 Zeros of Polynomials
    §1.11 Zeros of Polynomials
    §1.11(i) Division Algorithm
    §1.11(ii) Elementary Properties
    Both polynomials have one change of sign; hence for each polynomial there is one positive zero, one negative zero, and six complex zeros. … For another method see §4.43. …
    10: 9.17 Methods of Computation
    §9.17 Methods of Computation
    The former reference includes a parallelized version of the method. … In these cases boundary-value methods need to be used instead; see §3.7(iii). … The second method is to apply generalized Gauss–Laguerre quadrature (§3.5(v)) to the integral (9.5.8). For the second method see also Gautschi (2002a). …