A parallel global adaptive quadrature algorithm for hypercubes (Q1110990)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A parallel global adaptive quadrature algorithm for hypercubes |
scientific article; zbMATH DE number 4074327
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel global adaptive quadrature algorithm for hypercubes |
scientific article; zbMATH DE number 4074327 |
Statements
A parallel global adaptive quadrature algorithm for hypercubes (English)
0 references
1988
0 references
The authors develop a parallel global adaptive quadrature algorithm for hypercubes and study the influence of heuristics present in the algorithm. A mathematical model for how long time it takes to process a balanced tree of subintervals under certain conditions is developed. They analyse the complexity of the algorithm. The results of a numerical experiment are given.
0 references
cubature formulas
0 references
numerical example
0 references
parallel global adaptive quadrature algorithm for hypercubes
0 references
complexity
0 references
