期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Average Error Bounds of Trigonometric Approximation on Periodic Wiener Spaces
1
作者 Cheng Yong WANG Rui Min WANG 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2013年第3期535-546,共12页
In this paper, we study the approximation of identity operator and the convolution inte- gral operator Bm by Fourier partial sum operators, Fejer operators, Vallee--Poussin operators, Ces^ro operators and Abel mean op... In this paper, we study the approximation of identity operator and the convolution inte- gral operator Bm by Fourier partial sum operators, Fejer operators, Vallee--Poussin operators, Ces^ro operators and Abel mean operators, respectively, on the periodic Wiener space (C1 (R), W°) and obtaia the average error estimations. 展开更多
关键词 Average error bounds trigonometric polynomial approximation periodic Wiener spaces
原文传递
Best m-term One-sided Trigonometric Approximation of Some Function Classes Defined by a Kind of Multipliers
2
作者 Ren Suo LI Yong Ping LIU 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2010年第5期975-984,共10页
In this paper, we continue studying the so-called non-linear best m-term one-sided approximation problems and obtain the asymptotic estimations of non-linear best m-term one-sided trigonometric approximation under the... In this paper, we continue studying the so-called non-linear best m-term one-sided approximation problems and obtain the asymptotic estimations of non-linear best m-term one-sided trigonometric approximation under the norm Lp (1 ≤ p ≤ ∞) of multiplier function classes and the corresponding m-term Greedy-liked one-sided trigonometric approximation results. 展开更多
关键词 non-linear best m-term approximation one-sided approximation Lp spaces trigonometric function system and Greedy approximation algorithm
原文传递
NEURAL NETWORKS AND THE BEST TRIGOMOMETRIC APPROXIMATION 被引量:1
3
作者 Jianjun WANG ZongbenXU 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2011年第2期401-412,共12页
With the best trigonometric polynomial approximation as a metric, the rate of approxi- mation of the one-hidden-layer feedforward neural networks to approximate an integrable function is estimated by using a construct... With the best trigonometric polynomial approximation as a metric, the rate of approxi- mation of the one-hidden-layer feedforward neural networks to approximate an integrable function is estimated by using a constructive approach in this paper. The obtained result shows that for any 2π-periodic integrable function, a neural networks with sigmoidal hidden neuron can be constructed to approximate the function, and that the rate of approximation do not exceed the double of the best trigonometric polynomial approximation of function. 展开更多
关键词 approximation best trigonometric approximation neural networks
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部