About the Project

Wynn%20cross%20rule

AdvancedHelp

(0.002 seconds)

1—10 of 215 matching pages

1: 20 Theta Functions
Chapter 20 Theta Functions
2: Bibliography W
  • J. Waldvogel (2006) Fast construction of the Fejér and Clenshaw-Curtis quadrature rules. BIT 46 (1), pp. 195–202.
  • R. S. Ward (1987) The Nahm equations, finite-gap potentials and Lamé functions. J. Phys. A 20 (10), pp. 2679–2683.
  • T. Watanabe, M. Natori, and T. Oguni (Eds.) (1994) Mathematical Software for the P.C. and Work Stations – A Collection of Fortran 77 Programs. North-Holland Publishing Co., Amsterdam.
  • Wolfram’s Mathworld (website)
  • P. Wynn (1966) Upon systems of recursions which obtain among the quotients of the Padé table. Numer. Math. 8 (3), pp. 264–269.
  • 3: 8 Incomplete Gamma and Related
    Functions
    4: 28 Mathieu Functions and Hill’s Equation
    5: 18.40 Methods of Computation
    Results of low ( 2 to 3 decimal digits) precision for w ( x ) are easily obtained for N 10 to 20 . Gautschi (2004, p. 119–120) has explored the ε 0 + limit via the Wynn ε -algorithm, (3.9.11) to accelerate convergence, finding four to eight digits of precision in w ( x ) , depending smoothly on x , for N 4000 , for an example involving first numerator Legendre OP’s. …
    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 N , 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 w ( x ) for these OP systems on x [ 1 , 1 ] and ( , ) respectively, Reinhardt (2018), and Reinhardt (2021b), Reinhardt (2021a). …
    6: 23 Weierstrass Elliptic and Modular
    Functions
    7: Bibliography M
  • A. J. MacLeod (1996b) Rational approximations, software and test methods for sine and cosine integrals. Numer. Algorithms 12 (3-4), pp. 259–272.
  • Maple (commercial interactive system) Maplesoft.
  • Fr. Mechel (1966) Calculation of the modified Bessel functions of the second kind with complex argument. Math. Comp. 20 (95), pp. 407–412.
  • R. Metzler, J. Klafter, and J. Jortner (1999) Hierarchies and logarithmic oscillations in the temporal relaxation patterns of proteins and other complex systems. Proc. Nat. Acad. Sci. U .S. A. 96 (20), pp. 11085–11089.
  • D. S. Moak (1981) The q -analogue of the Laguerre polynomials. J. Math. Anal. Appl. 81 (1), pp. 20–47.
  • 8: Bibliography
  • M. J. Ablowitz and H. Segur (1977) Exact linearization of a Painlevé transcendent. Phys. Rev. Lett. 38 (20), pp. 1103–1106.
  • A. Adelberg (1992) On the degrees of irreducible factors of higher order Bernoulli polynomials. Acta Arith. 62 (4), pp. 329–342.
  • D. E. Amos (1989) Repeated integrals and derivatives of K Bessel functions. SIAM J. Math. Anal. 20 (1), pp. 169–175.
  • Arblib (C) Arb: A C Library for Arbitrary Precision Ball Arithmetic.
  • Axiom (free interactive system) Center for Algorithms and Interactive Scientific Software.
  • 9: 3.11 Approximation Techniques
    The Padé approximants can be computed by Wynn’s cross rule. Any five approximants arranged in the Padé table as … For the recursive computation of [ n + k / k ] f by Wynn’s epsilon algorithm, see (3.9.11) and the subsequent text. …
    10: Bibliography G
  • W. Gautschi (1994) Algorithm 726: ORTHPOL — a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules. ACM Trans. Math. Software 20 (1), pp. 21–62.
  • A. Gil, J. Segura, and N. M. Temme (2014) Algorithm 939: computation of the Marcum Q-function. ACM Trans. Math. Softw. 40 (3), pp. 20:1–20:21.
  • E. T. Goodwin (1949a) Recurrence relations for cross-products of Bessel functions. Quart. J. Mech. Appl. Math. 2 (1), pp. 72–74.
  • Ya. I. Granovskiĭ, I. M. Lutzenko, and A. S. Zhedanov (1992) Mutual integrability, quadratic algebras, and dynamical symmetry. Ann. Phys. 217 (1), pp. 1–20.
  • GSL (free C library) GNU Scientific Library The GNU Project.