CADRE: An algorithm for numerical quadrature. This chapter discusses the program CADRE — an algorithm for numerical quadrature. The program employs an adaptive scheme whereby CADRE is found as the sum of estimates for the integral of F(x) over suitably small subintervals of a given interval of integration. Starting with the interval of integration itself as the first such subinterval, the program attempts to find an acceptable estimate on a given subinterval by cautious Romberg extrapolation. If this attempt fails, the subinterval is divided into two subintervals of equal length. For the sake of economy, values of F(x), once calculated, are saved until they are successfully used in estimating the integral over some subinterval to which they belong. The program CADRE uses the composite trapezoid sum. For certain classes of integrands, the composite trapezoid sum exhibits a known and characteristic convergence behavior that the algorithm attempts to detect and to exploit through cautious extrapolation.

References in zbMATH (referenced in 25 articles )

Showing results 1 to 20 of 25.
Sorted by year (citations)

1 2 next

  1. Gonnet, Pedro: Increasing the reliability of adaptive quadrature using explicit interpolants (2010)
  2. Chen, Chin-Yun: Bivariate product cubature using peano kernels for local error estimates (2008)
  3. Plaskota, Leszek; Wasilkowski, Grzegorz W.; Zhao, Yaxi: The power of adaption for approximating functions with singularities (2008)
  4. Shampine, L. F.: Vectorized adaptive quadrature in MATLAB (2008)
  5. Chen, Chin-Yun: Computing interval enclosures for definite integrals by application of triple adaptive strategies (2006)
  6. Plaskota, Leszek; Wasilkowski, Grzegorz W.: Adaption allows efficient integration of functions with unknown singularities (2005)
  7. Bialecki, B.; Keast, P.: A sinc quadrature subroutine for Cauchy principal value integrals (1999)
  8. Cheng, Jung-Ho: Adaptive grid optimization for structural analysis -- Geometry-based approach (1993)
  9. Suhartanto, Heru; Enright, Wayne H.: Detecting and locating a singular point in the numerical solution of IVPs for ODEs (1992)
  10. Sugiura, Hiroshi; Sakurai, Tetsuya: On the construction of high-order integration formulae for the adaptive quadrature method (1989)
  11. Moss, William F.: Collocation for an integral equation arising in duct acoustics (1986)
  12. Laurie, Dirk P.: Practical error estimation in numerical integration (1985)
  13. Schwab, Andreas J.: Extension of the theory of the multiple-indicator dilution technique to metabolic systems with an arbitrary number of rate constants (1984)
  14. Michalsky, Douglas L.; Wise, Gary L.; Poor, H. Vincent: A relative efficiency study of some popular detectors (1982)
  15. Miura, Robert M.: Accurate computation of the stable solitary wave for the FitzHugh-Nagumo equations (1982)
  16. Lorenzen, Thomas J.; McDonald, Gary C.: Selecting logistic populations using the sample medians (1981)
  17. Einarsson, Bo: Bibliography on the evaluation of numerical software (1979)
  18. Midy, P.; Yakovlev, Y.: An extrapolation method for the quadrature of functions with singularities in the vicinity of the interval of integration (1979)
  19. Robinson, Ian: A comparison of numerical integration programs (1979)
  20. Garribba, S.; Quartapelle, L.; Reina, G.: Algorithm 36. SNIFF: Efficient self-tuning algorithm for numerical integration (1978)

1 2 next