Abstract
Boolean methods of interpolation [1,4] have been applied to construct multivariate quadrature rules for periodic functions of Korobov classes which are comparable with lattice rules of numerical integration [6,7]. In particular, we introducedd-variate Boolean trapezoidal rules [3,4] andd-variate Boolean midpoint rules [2,4]. The basic tools for constructing Boolean midpoint rules are Boolean midpoint sums. It is the purpose of this paper to use a modification of these Boolean midpoint sums to compute Boolean trapezoidal rules in an efficient way.
Similar content being viewed by others
References
G. Baszenski and F.-J. Delvos, Remainders for Boolean interpolation, in:Progress in Approximation Theory, eds. P. Nevai and A. Pinkus (Academic Press, 1991).
G. Baszenski and F.-J. Delvos, Multivariate Boolean midpoint rules, in:Numerical Integration IV, eds. H. Brass and G. Hämmerlin, ISNM 112 (Birkhäuser, Basel, 1993).
G. Baszenski and F.-J. Delvos, Multivariate Boolean trapezoidal rules, in:Approximation, Probability, and Related Fields, eds. G. Anastassiou and S.T. Rachev (Plenum, New York, 1994).
F.-J. Delvos,d-variate Boolean interpolation, J. Approx. Theory 34 (1982).
F.-J. Delvos, Boolean methods for double integration, Math. Comp. 55 (1990).
I.H. Sloan, Lattice methods for multiple integration. J. Comp. Appl. Math. 12–13 (1985).
I.H. Sloan, Lattice methods for multiple integration: Theory, error analysis and examples, SIAM J. Numer. Anal. 24 (1987).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Baszenski, G., Delvos, FJ. Computational aspects of Boolean cubature. Numer Algor 10, 1–11 (1995). https://doi.org/10.1007/BF02198292
Issue Date:
DOI: https://doi.org/10.1007/BF02198292