Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Journal of Approxima...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Journal of Approximation Theory
Article
License: Elsevier Non-Commercial
Data sources: UnpayWall
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Journal of Approximation Theory
Article . 2000
License: Elsevier Non-Commercial
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Journal of Approximation Theory
Article . 2000 . Peer-reviewed
License: Elsevier Non-Commercial
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2000
Data sources: zbMATH Open
versions View all 4 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Continuous Algorithms in n-Term Approximation and Non-Linear Widths

Continuous algorithms in \(n\)-term approximation and nonlinear widths
Authors: Dung, Dinh;

Continuous Algorithms in n-Term Approximation and Non-Linear Widths

Abstract

Let \(X \) be a quasi-normed linear space and \(\Phi = \{\phi_k\}_{k=1}^{\infty} \) a family of elements in \(X\). If the family \(\Phi \) is bounded, i.e., \(\|\phi_k\|\leq C\), \(k=1,2,\dots\), and the span of \(\Phi \) is dense in \(X\), then \(\Phi \) is called a dictionary. Denote by \(M_n(\Phi)\) the set of all linear combinations \(\phi =\sum_{k\in Q}a_k\phi _k\), where \(Q\) is a set of natural numbers with \(|Q|=n\). If \(W\) is a subset \(X\) then the quantity \(\sigma_n(W,\Phi ,X) = \sup_{f\in W}\inf_{\phi \in M_n(\Phi)} \|f-\phi \|\) is called the \(n\)-term approximation of \(W\) by the family \(\Phi \). In this paper the author considers optimal continuous algorithms in \(n\)-term approximation based on various non-linear \(n\)-widths, and the \(n\)-term approximation \(\sigma_n(W,V,X)\) by the dictionary \(V\) formed from the integer translates of the mixed dyadic scales of the tensor product multivariate de la Vallée Poussin kernel, for the unit ball of Sobolev and Besov spaces of functions with a common mixed smoothness. The asymptotic orders of these quantities are given. These orders are achieved by a continuous algorithm of \(n\)-term approximation by \(V\), which is explicitly constructed.

Keywords

Mathematics(all), Numerical Analysis, \(n\)-term approximation, Applied Mathematics, Approximation by arbitrary nonlinear expressions; widths and entropy, \(n\)-widths, Rate of convergence, degree of approximation, Vallée Poussin kernel, Research exposition (monographs, survey articles) pertaining to approximations and expansions, Besov spaces, Sobolev spaces, Analysis

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    25
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
25
Average
Top 10%
Average
hybrid