About the Project

Wynn cross rule

AdvancedHelp

(0.001 seconds)

1—10 of 145 matching pages

1: Bibliography W
  • J. Waldvogel (2006) Fast construction of the Fejér and Clenshaw-Curtis quadrature rules. BIT 46 (1), pp. 195–202.
  • 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.
  • 2: 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. …
    3: 18.40 Methods of Computation
    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 …
    See accompanying text
    Figure 18.40.2: Derivative Rule inversions for w RCP ( x ) carried out via Lagrange and PWCF interpolations. … Magnify
    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). …
    4: Bibliography
  • G. Allasia and R. Besenghi (1987a) Numerical computation of Tricomi’s psi function by the trapezoidal rule. Computing 39 (3), pp. 271–279.
  • G. Allasia and R. Besenghi (1991) Numerical evaluation of the Kummer function with complex argument by the trapezoidal rule. Rend. Sem. Mat. Univ. Politec. Torino 49 (3), pp. 315–327.
  • G. Allasia and R. Besenghi (1987b) Numerical calculation of incomplete gamma functions by the trapezoidal rule. Numer. Math. 50 (4), pp. 419–428.
  • Arblib (C) Arb: A C Library for Arbitrary Precision Ball Arithmetic.
  • Axiom (free interactive system) Center for Algorithms and Interactive Scientific Software.
  • 5: Bibliography T
  • N. M. Temme (1978) The numerical computation of special functions by use of quadrature rules for saddle point integrals. II. Gamma functions, modified Bessel functions and parabolic cylinder functions. Report TW 183/78 Mathematisch Centrum, Amsterdam, Afdeling Toegepaste Wiskunde.
  • W. J. Thompson (1997) Atlas for Computing Mathematical Functions: An Illustrated Guide for Practitioners. John Wiley & Sons Inc., New York.
  • 6: Bibliography G
  • M. J. Gander and A. H. Karp (2001) Stable computation of high order Gauss quadrature rules using discretization for measures in radiation transfer. J. Quant. Spectrosc. Radiat. Transfer 68 (2), pp. 213–223.
  • A. Gil, J. Segura, and N. M. Temme (2003b) Computing special functions by using quadrature rules. Numer. Algorithms 33 (1-4), pp. 265–275.
  • G. H. Golub and J. H. Welsch (1969) Calculation of Gauss quadrature rules. Math. Comp. 23 (106), pp. 221–230.
  • E. T. Goodwin (1949a) Recurrence relations for cross-products of Bessel functions. Quart. J. Mech. Appl. Math. 2 (1), pp. 72–74.
  • GSL (free C library) GNU Scientific Library The GNU Project.
  • 7: 37.20 Mathematical Applications
    A minimal cubature rule is a numerical integration rule that uses the smallest number of nodes among cubature rules of the same degree. The nodes of these cubature rules are closely related to common zeros of OPs and they are often good points for polynomial interpolation. Although Gaussian cubature rules rarely exist and they do not exist for centrally symmetric domains, minimal or near minimal cubature rules on the unit square are known and provide efficient numerical integration rules. …
    8: Bibliography R
  • REDUCE (free interactive system)
  • W. P. Reinhardt (2018) Universality properties of Gaussian quadrature, the derivative rule, and a novel approach to Stieltjes inversion.
  • W. P. Reinhardt (2021a) Erratum to:Relationships between the zeros, weights, and weight functions of orthogonal polynomials: Derivative rule approach to Stieltjes and spectral imaging. Computing in Science and Engineering 23 (4), pp. 91.
  • W. P. Reinhardt (2021b) Relationships between the zeros, weights, and weight functions of orthogonal polynomials: Derivative rule approach to Stieltjes and spectral imaging. Computing in Science and Engineering 23 (3), pp. 56–64.
  • K. Rottbrand (2000) Finite-sum rules for Macdonald’s functions and Hankel’s symbols. Integral Transform. Spec. Funct. 10 (2), pp. 115–124.
  • 9: Bibliography M
  • Maple (commercial interactive system) Maplesoft.
  • Mathematica (commercial interactive system) Wolfram Research, Inc..
  • Matlab (commercial interactive system) The MathWorks, Inc..
  • Maxima (free interactive system)
  • mpmath (free python library)
  • 10: 1.6 Vectors and Vector-Valued Functions
    Cross Product (or Vector Product)
    1.6.9 𝐚 × 𝐛 = | 𝐢 𝐣 𝐤 a 1 a 2 a 3 b 1 b 2 b 3 | = ( a 2 b 3 a 3 b 2 ) 𝐢 + ( a 3 b 1 a 1 b 3 ) 𝐣 + ( a 1 b 2 a 2 b 1 ) 𝐤 = 𝐚 𝐛 ( sin θ ) 𝐧 ,
    where 𝐧 is the unit vector normal to 𝐚 and 𝐛 whose direction is determined by the right-hand rule; see Figure 1.6.1.
    See accompanying text
    Figure 1.6.1: Vector notation. Right-hand rule for cross products. Magnify