Approximation on anisotropic Besov classes with mixed norms by standard information (Q558005): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jco.2004.09.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055697568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal approximation bounds for superpositions of a sigmoidal function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rates of convex approximation in non-Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Huber concerning the convergence of projection pursuit regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous approximation by greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Martingales with values in uniformly convex spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithms in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear methods of approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5469262 / rank
 
Normal rank

Latest revision as of 12:10, 10 June 2024

scientific article
Language Label Description Also known as
English
Approximation on anisotropic Besov classes with mixed norms by standard information
scientific article

    Statements

    Approximation on anisotropic Besov classes with mixed norms by standard information (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2005
    0 references
    Let \(\mathbb{T}^d\) be the \(d\)-dimensional torus, let \(X\) be a normed linear space of real functions defined on \(\mathbb{T}^d\), and let \(C(\mathbb{T}^d)\) be the space of all real, continuous and periodic functions on \(\mathbb{T}^d\). In order to compare different approximation algorithms that are applicable to the functions belonging to a given set \(K\subset C(\mathbb{T}^d)\cap X\) and are based on standard information, i.e. the values of the involved functions at \(n\) points chosen from \(\mathbb{T}^d\), the \(n\)th minimum intrinsic error \(e_m\) and the \(n\)th minimum linear intrinsic error \(e^L_n\) are relevant. In the present paper the authors estimate these errors in the case when \(X:= L^{{\mathbf s}}_{{\mathbf q}}(\mathbb{T}^d)\) and \(K\) is the unit ball of the anisotropic Besov space \(B^{{\mathbf r}}_{{\mathbf p}\theta}(\mathbb{T}^d)\), where \({\mathbf s}: =(s_1,\dots, s_d)\), \({\mathbf q}:= (q_1,\dots, q_d)\), \({\mathbf r}= (r_1,\dots, r_d)\) and \({\mathbf p}:= (p_1,\dots, p_d)\) are vectors satisfying \(s_i\in \mathbb{Z}_+\), \(1\leq q_i\), \(1< r_i\), \(1\leq p_i\) for \(i:= 1,\dots, d\), and \(\theta\) is a number satisfying \(1\leq\theta\leq\infty\). By using the Dirichlet approximation algorithm they reveal cases (depending on \({\mathbf p}\) and \({\mathbf q}\)) when the asymptotic equalities \[ e_n\asymp e^L_n\asymp n^{-g(r)(1-\beta)}\quad \text{and} \quad e_n\asymp e^L_n\asymp n^{-g(r)(1-\beta)+ g(r)\gamma} \] hold, where \[ \begin{aligned} g(r)&:= 1/\Biggl(\sum^d_{i=1} 1/r_i\Biggr),\\ \beta&:= \max(s_1/r_1,\dots, s_d/r_d),\;\gamma:= \sum^d_{i=1} (1/p_i- 1/q_i)1/r_i. \end{aligned} \]
    0 references
    Information-based complexity
    0 references
    Exact order
    0 references
    Interpolation
    0 references
    Optimal recovery
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references