2016
DOI: 10.1016/j.jco.2015.07.001
|View full text |Cite
|
Sign up to set email alerts
|

On equivalence of weighted anchored and ANOVA spaces of functions with mixed smoothness of order one in L1 or L

Abstract: a b s t r a c tWe consider weighted anchored and ANOVA spaces of functions with mixed first order partial derivatives bounded in L 1 or L ∞ norms. We provide conditions on the weights under which the corresponding spaces have equivalent norms with constants independent of, or only polynomially dependent on the number of variables.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
63
0

Year Published

2016
2016
2018
2018

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 22 publications
(65 citation statements)
references
References 21 publications
(12 reference statements)
2
63
0
Order By: Relevance
“…As in [3], one can show that the spaces F s,p 1 ,p 2 ,γ and F s,p 1 ,p 2 ,γ,ω as sets of functions are equal if and only if…”
Section: Unanchored Spaces Of Multivariate Functionsmentioning
confidence: 81%
See 1 more Smart Citation
“…As in [3], one can show that the spaces F s,p 1 ,p 2 ,γ and F s,p 1 ,p 2 ,γ,ω as sets of functions are equal if and only if…”
Section: Unanchored Spaces Of Multivariate Functionsmentioning
confidence: 81%
“…In this section, we begin by recalling the definitions and basic properties of weighted anchored Sobolev spaces of s-variate functions with mixed partial derivatives of order one bounded in L p -norm. More detailed information can be found in [3,4,14]. Such spaces have often been assumed in the context of quasi-Monte Carlo methods.…”
Section: Anchored Spaces Of Multivariate Functionsmentioning
confidence: 99%
“…In particular we have ε 10 −1 10 −2 10 −3 10 −4 10 −5 10 −6 dim trnc (ε) 3 Consider next p > 1. Unlike in the case p = 1, we do not know the exact values of the truncation dimension.…”
Section: Proposition 2 For Product Weights and K < S The Truncation mentioning
confidence: 99%
“…Remark 4.5. The algorithms used to derive the error bound (21) belong to the class of interlaced scrambled polynomial lattice rules. For a given prime base b an interlaced scrambled polynomial lattice rule Q of order r consisting of b m points in dimension s is constructed in the following way: First an ordinary polynomial lattice rule with b m points in dimension rs is generated and afterwards the points are randomized via Owen's b-ary digit scrambling [39].…”
Section: 2mentioning
confidence: 99%