Computational aspects of Boolean cubature

DOI10.1007/BF02198292MaRDI QIDQ1895977zbMATH OpenFDO

Authors Günter Baszenski, Franz-Jürgen Delvos

Publication date 5 March 1996

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02198292

zbMATH Keywords

Boolean cubatureBoolean midpoint ruleBoolean trapezoidal ruletensor product trapezoidal rules

Mathematics Subject Classification ID

Approximate quadratures (41A55) Multidimensional problems (41A63) Numerical quadrature and cubature formulas (65D32)

Review text

A \(d\)-variate Boolean trapezoidal rule is defined as a linear combination of \(d\)-variate tensor product trapezoidal rules: \[ H^{q,d} [f] = \sum^{d-1}_{j=0} (-1)^j {d - 1\choose j} \sum_{k_1 + \dots + k_d = q - j} T(k_1, \dots, k_d) [f]. \] A \(d\)-variate Boolean midpoint rule is constructed similarly. It is shown: One can compute Boolean trapezoidal rules efficiently by a modification of these Boolean midpoint sums.

Recommendations

• Publication:4885489
• scientific article; zbMATH DE number 524163
• Publication:4731632
• Boolean Methods for Double Integration
• scientific article; zbMATH DE number 2092674

Cites work

• Boolean Methods for Double Integration
• d-Variate Boolean interpolation
• scientific article; zbMATH DE number 524163 (Why is no real title available?)
• scientific article; zbMATH DE number 903852 (Why is no real title available?)
• Lattice methods for multiple integration
• Lattice Methods for Multiple Integration: Theory, Error Analysis and Examples

Cited in

(3)

• scientific article; zbMATH DE number 524163 (Why is no real title available?)
• scientific article; zbMATH DE number 903852 (Why is no real title available?)
• Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions

This page was built for publication: Computational aspects of Boolean cubature

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1895977)