Constructing lattice points for numerical integration by a reduced fast successive coordinate search algorithm (Q1715796)
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: Constructing lattice points for numerical integration by a reduced fast successive coordinate search algorithm |
scientific article; zbMATH DE number 7007559
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing lattice points for numerical integration by a reduced fast successive coordinate search algorithm |
scientific article; zbMATH DE number 7007559 |
Statements
Constructing lattice points for numerical integration by a reduced fast successive coordinate search algorithm (English)
0 references
29 January 2019
0 references
numerical integration
0 references
lattice points
0 references
polynomial lattice points
0 references
quasi-Monte Carlo methods
0 references
weighted function spaces
0 references
component-by-component construction
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8767848610877991
0 references
0.8722050189971924
0 references
0.8466356992721558
0 references
0.830484926700592
0 references
