Computational aspects of Boolean cubature (Q1895977)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 784677
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational aspects of Boolean cubature |
scientific article; zbMATH DE number 784677 |
Statements
Computational aspects of Boolean cubature (English)
0 references
5 March 1996
0 references
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.
0 references
Boolean cubature
0 references
Boolean trapezoidal rule
0 references
tensor product trapezoidal rules
0 references
Boolean midpoint rule
0 references
0.7758541107177734
0 references
