Bairstow method (for zeros of polynomials)
(0.003 seconds)
11—20 of 417 matching pages
11: 28.34 Methods of Computation
§28.34 Methods of Computation
… ►Methods available for computing the values of needed in (28.2.16) include: … ►12: Bibliography K
…
►
Numerical Methods and Software.
Prentice Hall, Englewood Cliffs, N.J..
…
►
Methods of computing the Riemann zeta-function and some generalizations of it.
USSR Comput. Math. and Math. Phys. 20 (6), pp. 212–230.
►
The Rayleigh function: Theory and computational methods.
Zh. Vychisl. Mat. Mat. Fiz. 39 (12), pp. 1962–2006.
…
►
An indirect method for evaluating certain infinite integrals.
Z. Angew. Math. Phys. 29 (3), pp. 380–386.
…
►
Zeros of exceptional Hermite polynomials.
J. Approx. Theory 200, pp. 28–39.
…
13: 18.38 Mathematical Applications
…
►
Differential Equations: Spectral Methods
►Linear ordinary differential equations can be solved directly in series of Chebyshev polynomials (or other OP’s) by a method originated by Clenshaw (1957). This process has been generalized to spectral methods for solving partial differential equations. … ►Quadrature “Extended” to Pseudo-Spectral (DVR) Representations of Operators in One and Many Dimensions
… ►These methods have become known as pseudo-spectral, and are overviewed in Cerjan (1993), and Shizgal (2015). …14: 35.10 Methods of Computation
§35.10 Methods of Computation
►For small values of the zonal polynomial expansion given by (35.8.1) can be summed numerically. … ►Other methods include numerical quadrature applied to double and multiple integral representations. … ►Koev and Edelman (2006) utilizes combinatorial identities for the zonal polynomials to develop computational algorithms for approximating the series expansion (35.8.1). …15: 1 Algebraic and Analytic Methods
Chapter 1 Algebraic and Analytic Methods
…16: 27.19 Methods of Computation: Factorization
§27.19 Methods of Computation: Factorization
… ►Type I probabilistic algorithms include the Brent–Pollard rho algorithm (also called Monte Carlo method), the Pollard algorithm, and the Elliptic Curve Method (ecm). …As of January 2009 the largest prime factors found by these methods are a 19-digit prime for Brent–Pollard rho, a 58-digit prime for Pollard , and a 67-digit prime for ecm. … ►These algorithms include the Continued Fraction Algorithm (cfrac), the Multiple Polynomial Quadratic Sieve (mpqs), the General Number Field Sieve (gnfs), and the Special Number Field Sieve (snfs). …17: 29 Lamé Functions
…
18: Bibliography L
…
►
The real zeros of the Bernoulli polynomials.
J. Approx. Theory 58 (2), pp. 124–150.
…
►
An application of the finite element approximation method to find the complex zeros of the modified Bessel function
.
Math. Comp. 33 (148), pp. 1299–1306.
…
►
Approximation of orthogonal polynomials in terms of Hermite polynomials.
Methods Appl. Anal. 6 (2), pp. 131–146.
…
►
Monotonicity of the zeros of the third derivative of Bessel functions.
Methods Appl. Anal. 2 (1), pp. 103–111.
…
►
The zeros of the third derivative of Bessel functions of order less than one.
Methods Appl. Anal. 2 (2), pp. 147–159.
…
19: Bibliography D
…
►
On the zeros of generalized Bessel polynomials. I.
Nederl. Akad. Wetensch. Indag. Math. 84 (1), pp. 1–13.
►
On the zeros of generalized Bessel polynomials. II.
Nederl. Akad. Wetensch. Indag. Math. 84 (1), pp. 14–25.
…
►
Zeros of Bernoulli, generalized Bernoulli and Euler polynomials.
Mem. Amer. Math. Soc. 73 (386), pp. iv+94.
…
►
On multiple zeros of Bernoulli polynomials.
Acta Arith. 134 (2), pp. 149–155.
…
►
Asymptotic approximations for the Jacobi and ultraspherical polynomials, and related functions.
Methods Appl. Anal. 6 (3), pp. 21–56.
…