Extensible hyperplane nets (Q640003): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ffa.2011.02.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063987878 / rank | |||
Normal rank | |||
Revision as of 20:58, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extensible hyperplane nets |
scientific article |
Statements
Extensible hyperplane nets (English)
0 references
12 October 2011
0 references
The authors give the construction algorithm for hyperplane nets (a generalization of polynomial lattice point sets), and prove that the constructed hyperplane nets are extensible and good with respect to a certain quality criterion. They also give some pure existence results for extensible hyperplane nets of good quality with respect to the worst-case integration error or the star discrepancy. Moreover, some numerical examples and discussions are also given.
0 references
digital nets
0 references
hyperplane nets
0 references
quasi-Monte Carlo
0 references
worst-case error
0 references
discrepancy
0 references
