Descartes’ rule of signs (for polynomials)
(0.006 seconds)
1—10 of 340 matching pages
1: 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.
…
2: 35.4 Partitions and Zonal Polynomials
§35.4 Partitions and Zonal Polynomials
… ►Normalization
… ►Orthogonal Invariance
… ►Summation
… ►Mean-Value
…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 expressions of ultraspherical, Chebyshev, and Legendre polynomials in terms of Jacobi polynomials, see §18.7(i). …For explicit power series coefficients up to for these polynomials and for coefficients up to for Jacobi and ultraspherical polynomials see Abramowitz and Stegun (1964, pp. 793–801). … ►Bessel polynomials
►Bessel polynomials are often included among the classical OP’s. …5: 1.11 Zeros of Polynomials
…
►Every monic (coefficient of highest power is one) polynomial of odd degree with real coefficients has at least one real zero with sign opposite to that of the constant term.
A monic polynomial of even degree with real coefficients has at least two zeros of opposite signs when the constant term is negative.
►
Descartes’ Rule of Signs
►The number of positive zeros of a polynomial with real coefficients cannot exceed the number of times the coefficients change sign, and the two numbers have same parity. … ►Both polynomials have one change of sign; hence for each polynomial there is one positive zero, one negative zero, and six complex zeros. …6: 3.8 Nonlinear Equations
…
►
§3.8(ii) Newton’s Rule
… ► … ►Newton’s rule is given by … ►Another iterative method is Halley’s rule: …The rule converges locally and is cubically convergent. …7: 3.5 Quadrature
…
►
§3.5(i) Trapezoidal Rules
… ►The composite trapezoidal rule is … ►§3.5(ii) Simpson’s Rule
… ►§3.5(iv) Interpolatory Quadrature Rules
… ►For the classical orthogonal polynomials related to the following Gauss rules, see §18.3. …8: 29.20 Methods of Computation
…
►A second approach is to solve the continued-fraction equations typified by (29.3.10) by Newton’s rule or other iterative methods; see §3.8.
…
►A fourth method is by asymptotic approximations by zeros of orthogonal polynomials of increasing degree.
…
►
§29.20(ii) Lamé Polynomials
… ►The corresponding eigenvectors yield the coefficients in the finite Fourier series for Lamé polynomials. … ►§29.20(iii) Zeros
…9: 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)). … ►Derivative Rule Approach
►An alternate, and highly efficient, approach follows from the derivative rule conjecture, see Yamani and Reinhardt (1975), and references therein, namely that … ►Further, exponential convergence in , via the Derivative Rule, rather than the power-law convergence of the histogram methods, is found for the inversion of Gegenbauer, Attractive, as well as Repulsive, Coulomb–Pollaczek, and Hermite weights and zeros to approximate for these OP systems on and respectively, Reinhardt (2018), and Reinhardt (2021b), Reinhardt (2021a). …10: 3.11 Approximation Techniques
…
►