International audienceIn this paper, we derive new general upper bounds on the star discrepancy of (t,m,s)-nets and (t,s)-sequences. These kinds of point sets are among the most widely used in quasi-Monte Carlo methods for numerical integration. By our new results, we improve on previous discrepancy bounds and prove a conjecture stated by the second author in an earlier paper
We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to t...
AbstractFor numerical integration in higher dimensions, bounds for the star-discrepancy with polynom...
For numerical integration in higher dimensions, bounds for the star-discrepancy with polynomial depe...
AbstractThe concepts of (t,m,s)-nets and (t,s)-sequences are among the best known classes of point s...
AbstractThe concepts of (t,m,s)-nets and (t,s)-sequences are among the best known classes of point s...
International audienceThe class of $(t,m,s)$-nets and $(t,s)$-sequences, introduced in their most ge...
International audienceThe class of $(t,m,s)$-nets and $(t,s)$-sequences, introduced in their most ge...
Error estimation in Monte-Carlo integration is related to the star discrepancy of random point sets....
Error estimation in Monte-Carlo integration is related to the star discrepancy of random point sets....
We study (0, 1)-sequences in arbitrary base b and derive a new upper bound on the star discrepancy o...
We study (0, 1)-sequences in arbitrary base b and derive a new upper bound on the star discrepancy o...
Quasi-Monte Carlo methods can be used to approximate integrals in various weighted spaces of functio...
Low-discrepancy point sets and sequences play an important role in quasi-Monte Carlo method for n...
AbstractUntil now (t,m,s)-nets in base b are the most important representatives in the family of low...
We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to t...
We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to t...
AbstractFor numerical integration in higher dimensions, bounds for the star-discrepancy with polynom...
For numerical integration in higher dimensions, bounds for the star-discrepancy with polynomial depe...
AbstractThe concepts of (t,m,s)-nets and (t,s)-sequences are among the best known classes of point s...
AbstractThe concepts of (t,m,s)-nets and (t,s)-sequences are among the best known classes of point s...
International audienceThe class of $(t,m,s)$-nets and $(t,s)$-sequences, introduced in their most ge...
International audienceThe class of $(t,m,s)$-nets and $(t,s)$-sequences, introduced in their most ge...
Error estimation in Monte-Carlo integration is related to the star discrepancy of random point sets....
Error estimation in Monte-Carlo integration is related to the star discrepancy of random point sets....
We study (0, 1)-sequences in arbitrary base b and derive a new upper bound on the star discrepancy o...
We study (0, 1)-sequences in arbitrary base b and derive a new upper bound on the star discrepancy o...
Quasi-Monte Carlo methods can be used to approximate integrals in various weighted spaces of functio...
Low-discrepancy point sets and sequences play an important role in quasi-Monte Carlo method for n...
AbstractUntil now (t,m,s)-nets in base b are the most important representatives in the family of low...
We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to t...
We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to t...
AbstractFor numerical integration in higher dimensions, bounds for the star-discrepancy with polynom...
For numerical integration in higher dimensions, bounds for the star-discrepancy with polynomial depe...
DOI
Add to ORKG