Sciweavers

8 search results - page 1 / 2
» Tractability of tensor product problems in the average case ...
Sort
View
JC
2011
102views more  JC 2011»
12 years 12 months ago
Tractability of tensor product problems in the average case setting
It has been an open problem to derive a necessary and sufficient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...
Anargyros Papageorgiou, Iasonas Petras
JC
2010
117views more  JC 2010»
12 years 11 months ago
Tractability through increasing smoothness
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithm...
Anargyros Papageorgiou, Henryk Wozniakowski
JC
2008
128views more  JC 2008»
13 years 5 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
JC
2011
87views more  JC 2011»
12 years 12 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
IPL
2008
89views more  IPL 2008»
13 years 5 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik