期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
LEBESGUE CONSTANT FOR LAGRANGE INTERPOLATION ON EQUIDISTANT NODES 被引量:3
1
作者 A.Eisinberg G.Fedele G.Franzè 《Analysis in Theory and Applications》 2004年第4期323-331,共9页
Properties of Lebesgue function for Lagrange interpolation on equidistant nodes are investigated. It is proved that Lebesgue function can be formulated both in terms of a hypergeometric function 2F1 and Jacobi polynom... Properties of Lebesgue function for Lagrange interpolation on equidistant nodes are investigated. It is proved that Lebesgue function can be formulated both in terms of a hypergeometric function 2F1 and Jacobi polynomials. Moreover, an integral expression of Lebesgue function is also obtained and the asymptotic behavior of Lebesgue constant is studied. 展开更多
关键词 Lagrange interpolation lebesgue function lebesgue constant
下载PDF
Efficiency of weak greedy algorithms for m-term approximations
2
作者 YE PeiXin WEI XiuJie 《Science China Mathematics》 SCIE CSCD 2016年第4期697-714,共18页
We investigate the efficiency of weak greedy algorithms for m-term expansional approximation with respect to quasi-greedy bases in general Banach spaces.We estimate the corresponding Lebesgue constants for the weak th... We investigate the efficiency of weak greedy algorithms for m-term expansional approximation with respect to quasi-greedy bases in general Banach spaces.We estimate the corresponding Lebesgue constants for the weak thresholding greedy algorithm(WTGA) and weak Chebyshev thresholding greedy algorithm.Then we discuss the greedy approximation on some function classes.For some sparse classes induced by uniformly bounded quasi-greedy bases of L_p,12 the WCGA is better than the TGA. 展开更多
关键词 m-term approximation lebesgue constants weak thresholding greedy algorithm weak Chebyshev greedy algorithm quasi-greedy bases
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部