Nonlinear Approximation with Dictionaries. II. Inverse Estimates

In this paper, which is the sequel to [16], we study inverse estimates of the Bernstein type for nonlinear approximation with structured redundant dictionaries in a Banach space. The main results are for blockwise incoherent dictionaries in Hilbert spaces, which generalize the notion of joint block-diagonal mutually incoherent bases introduced by Donoho and Huo. The Bernstein inequality obtained for such dictionaries is proved to be sharp, but it has an exponent that does not match that of the corresponding Jackson inequality.     

Fuzzy Closure Spaces vs. Fuzzy Rough Sets

This paper investigates the relationship among fuzzy rough sets, fuzzy closure spaces and fuzzy topology. It is shown that there exists a bijective correspondence between the set of all fuzzy reflexive approximation spaces and the set of all quasi-discrete fuzzy closure spaces satisfying a certain extra condition. Similar correspondence is also obtained between the set of all fuzzy tolerance approximation spaces and the set of all symmetric quasi-discrete fuzzy closure spaces satisfying a certain extra condition.     

SOME GENERALIZATIONS OF KY FAN＇S BEST APPROXIMATION THEOREM

We pressent new Ky Fan type best approximation theorems for a discontinuous multivalued map onmetrizable topological vector spaces and hyperconvex spaces. In addition, fixed point results are derivedfor the map studied. Our work generalizes severl results in approximation theory.     

A note on adaptive approximation in Sobolev spaces

In this article, we consider the adaptive approximation in Sobolev spaces. After establishing some norm equivalences and inequalities in Besov spaces, we are able to prove that the best N terms approximation with wavelet‐like basis in Sobolev spaces exhibits the proper approximation order in terms of N^?1. This indicates that the computational load in adaptive approximation is proportional to the approximation accuracy. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Banach 空间中非线性最佳逼近的广义强唯一性

设X是一致凸空间,G为X中太阳集,R．Smarzewski[1]证明了g∈G对x∈的最佳逼近具有广义强唯一性,本文讨论其逆,在最佳逼近是广义强唯一的条件下,研究了空间的凸性和逼近集的太阳性．     

Maxisets for Model Selection

We address the statistical issue of determining the maximal spaces (maxisets) where model selection procedures attain a given rate of convergence. By considering first general dictionaries, then orthonormal bases, we characterize these maxisets in terms of approximation spaces. These results are illustrated by classical choices of wavelet model collections. For each of them, the maxisets are described in terms of functional spaces. We give special attention to the issue of calculability and measure the induced loss of performance in terms of maxisets.     

SOME GENERALIZATIONS OF KY FAN''''S BEST APPROXIMATION THEOREM

We pressent new Ky Fan type best approximation theorems for a discontinuous multivalued map on metrizable topological vector spaces and hyperconvex spaces. In addition, fixed point results are derived for the map studied. Our work generalizes severl results in approximation theory.     

Best and coupled best approximation theorems in abstract convex metric spaces

In this paper, we first give a best approximation theorem in abstract convex metric spaces. As applications, we then derive some best and coupled best approximations and coupled coincidence point results in normed spaces and hyperconvex metric spaces.     

The Weak Chebyshev X-Greedy Algorithm in the unweighted Bergman space

We study a greedy algorithm called the Weak Chebyshev X-Greedy Algorithm (WCXGA) and investigate its application to unweighted Bergman spaces. We first show that the WCXGA converges for a wide class of real and complex Banach spaces and dictionaries. We then prove that certain Bergman spaces and their holomorphic monomial dictionaries belong to the class of Banach spaces for which the WCXGA converges.     

Ba空间中导数型的Jackson定理

本文研究了Ｂａ空间中的函数及其各阶导函数用多项式同时逼近的问题,证明了导数型的Ｊａｃｋｓｏｎ定理。     

Orlicz空间中的Müntz有理逼近

通过利用K泛函及光滑模、不等式等技巧,在Orlicz空间中讨论了Müntz有理逼近问题,得到了有理逼近的三种估计.     

ON THE LEAST DOMINANT CONTINUOUS MODULUS AND ITS APPLICATION

o.IntroductionInthispaperwedealwithqualltitativeKorovkintypetheoremsfortheaPproalmationbyboundedlinearoperatorsdefinedonC(X),andinparticularbypositiveones.HereC(X)=CR(X,d)denotestheBanachlatticeofreal-valuedcontinuousfunctionsdefinedonthecompactmetricspace(X,d)withnormgivenbylIfIlx=ma-xlf(x)I,xEX.WealsoassumethatXhasdiameterd(X)>o.ThefirstsuchtheoremforgeneralpositivelinearoperatorsandX=[a,b]equippedwiththeeuclidiandistanceisduetoR.Mamedovl4].Forspaces(X,d)beingmetricallyconvexinthes…     

On the equivalence of brushlet and wavelet bases

We prove that the Meyer wavelet basis and a class of brushlet systems associated with exponential type partitions of the frequency axis form a family of equivalent (unconditional) bases for the Besov and Triebel-Lizorkin function spaces. This equivalence is then used to obtain new results on nonlinear approximation with brushlets in Triebel-Lizorkin spaces.     

MATCHING PURSUITS AMONG SHIFTED CAUCHY KERNELS IN HIGHER-DIMENSIONAL SPACES

Appealing to the Clifford analysis and matching pursuits, we study the adaptive decompositions of functions of several variables of finite energy under the dictionaries consisting of shifted Cauchy kernels. This is a realization of matching pursuits among shifted Cauchy kernels in higher-dimensional spaces. It offers a method to process signals in arbitrary dimensions.     

Matching pursuits among shifted cauchy kernels in higher-dimensional spaces

Appealing to the Clifford analysis and matching pursuits, we study the adaptive decompositions of functions of several variables of finite energy under the dictionaries consisting of shifted Cauchy kernels. This is a realization of matching pursuits among shifted Cauchy kernels in higher-dimensional spaces. It offers a method to process signals in arbitrary dimensions.     

Hermite插值算子在Orlicz空间内的逼近

插值算子逼近是逼近论中一个非常有趣的问题,尤其是以一些特殊的点为结点的插值算子的逼近问题很受人们的关注.研究了以第一类Chebyshev多项式零点为插值结点的Hermite插值算子在Orlicz范数下的逼近.     

Nonlinear Approximation with Dictionaries I. Direct Estimates

We study various approximation classes associated with m-term approximation by elements from a (possibly redundant) dictionary in a Banach space. The standard approximation class associated with the best m-term approximation is compared to new classes defined by considering m-term approximation with algorithmic constraints: thresholding and Chebychev approximation classes are studied, respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space, and we prove that assuming a certain structure of the dictionary is sufficient and (almost) necessary to obtain stronger results. We give examples of classical dictionaries in L^p spaces and modulation spaces where our results recover some known Jackson type estimates, and discuss some new estimates they provide.     

Greedy algorithms in Banach spaces

We study efficiency of approximation and convergence of two greedy type algorithms in uniformly smooth Banach spaces. The Weak Chebyshev Greedy Algorithm (WCGA) is defined for an arbitrary dictionary D and provides nonlinear m-term approximation with regard to D. This algorithm is defined inductively with the mth step consisting of two basic substeps: (1) selection of an mth element _m ^c from D, and (2) constructing an m-term approximant G _m ^c . We include the name of Chebyshev in the name of this algorithm because at the substep (2) the approximant G _m ^c is chosen as the best approximant from Span( ₁ ^c ,..., _m ^c ). The term Weak Greedy Algorithm indicates that at each substep (1) we choose _m ^c as an element of D that satisfies some condition which is t _m -times weaker than the condition for _m ^c to be optimal (t _m =1). We got error estimates for Banach spaces with modulus of smoothness (u)u ^q , 1<q2. We proved that for any f from the closure of the convex hull of D the error of m-term approximation by WCGA is of order (1+t ₁ ^p ++t _m ^p )^–1/p , 1/p+1/q=1. Similar results are obtained for Weak Relaxed Greedy Algorithm (WRGA) and its modification. In this case an approximant G ^r _m is a convex linear combination of 0,₁ ^r ,..., ^r _m . We also proved some convergence results for WCGA and WRGA.     

Approximation of functions by certain nonlinear integral operators

We study approximation properties of certain nonlinear integral operators L _n * obtained by a modification of given operators L _n . The operators L _n;r and L _n;r * of r-times differentiable functions are also studied. We give theorems on approximation orders of functions by these operators in polynomial weight spaces.