نتایج جستجو برای: the best uniform polynomial approximation

تعداد نتایج: 16093837  

Journal: :EURASIP Journal on Advances in Signal Processing 2010

Journal: :Journal of Mathematical Analysis and Applications 2016

1998
Thomas Hofmeister Hanno Lefmann

We consider the problem of approximating the independence number and the chromatic number of k-uniform hypergraphs on n vertices. For xed integers k 2, we obtain for both problems that one can achieve in polynomial time approximation ratios of at most O(n=(log 1) n)2). This extends results of Boppana and Halld orsson [5] who showed for the graph case that an approximation ratio of O(n=(logn)) c...

Journal: :Bulletin of the American Mathematical Society 1925

2013
Abdellah Chkifa Albert Cohen Giovanni Migliorati Fabio Nobile Raul Tempone

Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate functions based on random sampling according to a given probability measure. Recent work has shown that in the univariate case and for the uniform distribution, the least-squares method is optimal in expectation in [1] and in probability in [7]...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید