About the Project

comparison with Gauss quadrature

AdvancedHelp

(0.003 seconds)

1—10 of 151 matching pages

1: 3.5 Quadrature
§3.5 Quadrature
For detailed comparisons of the Clenshaw–Curtis formula with Gauss quadrature3.5(v)), see Trefethen (2008, 2011).
§3.5(v) Gauss Quadrature
§3.5(viii) Complex Gauss Quadrature
2: Bibliography R
  • W. P. Reinhardt (2018) Universality properties of Gaussian quadrature, the derivative rule, and a novel approach to Stieltjes inversion.
  • K. Reinsch and W. Raab (2000) Elliptic Integrals of the First and Second Kind – Comparison of Bulirsch’s and Carlson’s Algorithms for Numerical Calculation. In Special Functions (Hong Kong, 1999), C. Dunkl, M. Ismail, and R. Wong (Eds.), pp. 293–308.
  • R. Roy (2017) Elliptic and modular functions from Gauss to Dedekind to Hecke. Cambridge University Press, Cambridge.
  • J. Rys, M. Dupuis, and H. F. King (1983) Computation of electron repulsion integrals using the Rys quadrature method. J. Comput. Chem. 4 (2), pp. 154–175.
  • 3: 35.10 Methods of Computation
    Other methods include numerical quadrature applied to double and multiple integral representations. See Yan (1992) for the F 1 1 and F 1 2 functions of matrix argument in the case m = 2 , and Bingham et al. (1992) for Monte Carlo simulation on 𝐎 ( m ) applied to a generalization of the integral (35.5.8). …
    4: 15.2 Definitions and Analytical Properties
    §15.2(i) Gauss Series
    The hypergeometric function F ( a , b ; c ; z ) is defined by the Gauss seriesOn the circle of convergence, | z | = 1 , the Gauss series: … For comparison of F ( a , b ; c ; z ) and 𝐅 ( a , b ; c ; z ) , with the former using the limit interpretation (15.2.5), see Figures 15.3.6 and 15.3.7. … Formula (15.4.6) reads F ( a , b ; a ; z ) = ( 1 z ) b . …
    5: 33.23 Methods of Computation
    Noble (2004) obtains double-precision accuracy for W η , μ ( 2 ρ ) for a wide range of parameters using a combination of recurrence techniques, power-series expansions, and numerical quadrature; compare (33.2.7). …
    6: 18.40 Methods of Computation
    A numerical approach to the recursion coefficients and quadrature abscissas and weights
    These quadrature weights and abscissas will then allow construction of a convergent sequence of approximations to w ( x ) , as will be considered in the following paragraphs. … The quadrature abscissas x n and weights w n then follow from the discussion of §3.5(vi). … The quadrature points and weights can be put to a more direct and efficient use. … Comparisons of the precisions of Lagrange and PWCF interpolations to obtain the derivatives, are shown in Figure 18.40.2. …
    7: 2.10 Sums and Sequences
    Hence … We need a “comparison function” g ( z ) with the properties: …
  • (c)

    The coefficients in the Laurent expansion

    2.10.27 g ( z ) = n = g n z n , 0 < | z | < r ,

    have known asymptotic behavior as n ± .

  • (b´)

    On the circle | z | = r , the function f ( z ) g ( z ) has a finite number of singularities, and at each singularity z j , say,

    2.10.30 f ( z ) g ( z ) = O ( ( z z j ) σ j 1 ) , z z j ,

    where σ j is a positive constant.

  • 2.10.32 f ( m ) ( z ) g ( m ) ( z ) = O ( ( z z j ) σ j 1 ) ,
    8: Bibliography L
  • J. L. López and P. J. Pagola (2011) A systematic “saddle point near a pole” asymptotic method with application to the Gauss hypergeometric function. Stud. Appl. Math. 127 (1), pp. 24–37.
  • J. L. López and N. M. Temme (2013) New series expansions of the Gauss hypergeometric function. Adv. Comput. Math. 39 (2), pp. 349–365.
  • L. Lorch (2002) Comparison of a pair of upper bounds for a ratio of gamma functions. Math. Balkanica (N.S.) 16 (1-4), pp. 195–202.
  • J. N. Lyness (1971) Adjusted forms of the Fourier coefficient asymptotic expansion and applications in numerical quadrature. Math. Comp. 25 (113), pp. 87–104.
  • 9: Bibliography E
  • U. T. Ehrenmark (1995) The numerical inversion of two classes of Kontorovich-Lebedev transform by direct quadrature. J. Comput. Appl. Math. 61 (1), pp. 43–72.
  • G. A. Evans and J. R. Webster (1999) A comparison of some methods for the evaluation of highly oscillatory integrals. J. Comput. Appl. Math. 112 (1-2), pp. 55–69.
  • 10: 18.38 Mathematical Applications
    Quadrature
    Classical OP’s play a fundamental role in Gaussian quadrature. If the nodes in a quadrature formula with a positive weight function are chosen to be the zeros of the n th degree OP with the same weight function, and the interval of orthogonality is the same as the integration range, then the weights in the quadrature formula can be chosen in such a way that the formula is exact for all polynomials of degree not exceeding 2 n 1 . …
    Quadrature “Extended” to Pseudo-Spectral (DVR) Representations of Operators in One and Many Dimensions
    The basic ideas of Gaussian quadrature, and their extensions to non-classical weight functions, and the computation of the corresponding quadrature abscissas and weights, have led to discrete variable representations, or DVRs, of Sturm–Liouville and other differential operators. …