2010
DOI: 10.1007/978-3-642-16876-5_2
|View full text |Cite
|
Sign up to set email alerts
|

Algorithms and Error Bounds for Multivariate Piecewise Constant Approximation

Abstract: Summary. We review the surprisingly rich theory of approximation of functions of many variables by piecewise constants. This covers for example the Sobolev-Poincaré inequalities, parts of the theory of nonlinear approximation, Haar wavelets and tree approximation, as well as recent results about approximation orders achievable on anisotropic partitions.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
5
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 24 publications
0
5
0
Order By: Relevance
“…If this condition is not satisfied, then we say that the partitions in the sequence are "anisotropic". It was shown in [4,5] (and earlier in [9] for d = 2) that on a wider set of all convex partitions D N significantly better order of approximation can be achieved. More precisely, for 1 p ∞,…”
Section: Introductionmentioning
confidence: 94%
See 4 more Smart Citations
“…If this condition is not satisfied, then we say that the partitions in the sequence are "anisotropic". It was shown in [4,5] (and earlier in [9] for d = 2) that on a wider set of all convex partitions D N significantly better order of approximation can be achieved. More precisely, for 1 p ∞,…”
Section: Introductionmentioning
confidence: 94%
“…under the same restrictions (2). No improvement of the order N − 1 d is possible for any smooth non-constant function f on "isotropic" partitions (see [4]). Recall that a sequence of convex partitions…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations