The complexities of weighted approximation and weighted integration problems for univariate functions defined over ℝ have recently been found in [7]. Complexity (almost) optimal algorithms have also been provided therein. In this paper, we propose another class of (almost) optimal algorithms that, for a number of instances, are easier to implement. More importantly, these new algorithms have a cost smaller than the original algorithms from [7]. Since both classes of algorithms are (almost) optimal, their costs differ by a multiplicative constant that depends on the specific weight functions and the error demand. In one of our tests we observed this constant to be as large as four, which means a cost reduction by a factor of four.
[1]
Francisco Curbera,et al.
Optimal Integration of Lipschitz Functions with a Gaussian Weight
,
1998,
J. Complex..
[2]
Peter Mathé.
Asymptotically Optimal Weighted Numerical Integration
,
1998,
J. Complex..
[3]
H. Woxniakowski.
Information-Based Complexity
,
1988
.
[4]
Henryk Wozniakowski,et al.
Information, Uncertainty, Complexity
,
1982
.
[5]
Grzegorz W. Wasilkowski,et al.
Complexity of Weighted Approximation over R
,
2000
.
[6]
Philip Rabinowitz,et al.
Methods of Numerical Integration
,
1985
.