Bairstow method (for zeros of polynomials)
1—10 of 412 matching pages
1: 35.4 Partitions and Zonal Polynomials
§35.4 Partitions and Zonal Polynomials… ►
Orthogonal Invariance… ►
2: 31.5 Solutions Analytic at Three Singularities: Heun Polynomials
§31.5 Solutions Analytic at Three Singularities: Heun Polynomials… ►
31.5.2►is a polynomial of degree , and hence a solution of (31.2.1) that is analytic at all three finite singularities . These solutions are the Heun polynomials. …
3: 24.1 Special Notation
Bernoulli Numbers and Polynomials►The origin of the notation , , is not clear. … ►
Euler Numbers and Polynomials… ►The notations , , as defined in §24.2(ii), were used in Lucas (1891) and Nörlund (1924). …
4: 18.3 Definitions
§18.3 Definitions… ►For exact values of the coefficients of the Jacobi polynomials , the ultraspherical polynomials , the Chebyshev polynomials and , the Legendre polynomials , the Laguerre polynomials , and the Hermite polynomials , see Abramowitz and Stegun (1964, pp. 793–801). … ►In addition to the orthogonal property given by Table 18.3.1, the Chebyshev polynomials , , are orthogonal on the discrete point set comprising the zeros , of : … ►For another version of the discrete orthogonality property of the polynomials see (3.11.9). … ►Legendre polynomials are special cases of Legendre functions, Ferrers functions, and associated Legendre functions (§14.7(i)). …
5: 3.8 Nonlinear Equations
§3.8 Nonlinear Equations… ►
Bisection Method… ►
Secant Method… ►
Eigenvalue Methods… ►
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: 18.40 Methods of Computation
§18.40 Methods of Computation►Orthogonal polynomials can be computed from their explicit polynomial form by Horner’s scheme (§1.11(i)). Usually, however, other methods are more efficient, especially the numerical solution of difference equations (§3.6) and the application of uniform asymptotic expansions (when available) for OP’s of large degree. ►However, for applications in which the OP’s appear only as terms in series expansions (compare §18.18(i)) the need to compute them can be avoided altogether by use instead of Clenshaw’s algorithm (§3.11(ii)) and its straightforward generalization to OP’s other than Chebyshev. …
8: Bibliography I
Bounds for the small real and purely imaginary zeros of Bessel and related functions.
Methods Appl. Anal. 2 (1), pp. 1–21.
An electrostatics model for zeros of general orthogonal polynomials.
Pacific J. Math. 193 (2), pp. 355–369.
More on electrostatic models for zeros of orthogonal polynomials.
Numer. Funct. Anal. Optim. 21 (1-2), pp. 191–204.
Bound on the extreme zeros of orthogonal polynomials.
Proc. Amer. Math. Soc. 115 (1), pp. 131–140.
On the asymptotic analysis of the Painlevé equations via the isomonodromy method.
Nonlinearity 7 (5), pp. 1291–1325.
9: 18.38 Mathematical Applications