Integration and approximation in arbitrary dimensions

Advances in Computational Mathematics

Volumn 12, Issue 1, 2000, Pages 25-58

  Hickernell, F J ^a   Wozniakowski H ^b,c  

^a HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

^b Columbia University ^*  (United States)

^c UNIVERSITY OF WARSAW   (Poland)

Author keywords

Curse of dimension; Multivariate approximation; Multivariate integration; Tractability

Indexed keywords

EID: 0041638501     PISSN: 10197168     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1018948631251     Document Type: Article

References (25)

1. N. Aronszajn, Theory of reproducing kernels, Trans. Amer. Math. Soc. 68 (1950) 337-404.
2. Z. Ciesielski, On Lévy's Brownian motion with several-dimensional time, in: Lecture Notes in Mathematics, Vol. 472, eds. A. Dold and B. Eckman (Springer, New York, 1975) pp. 29-56.
3. F.J. Hickernell, Quadrature error bounds with applications to lattice rules, SIAM J. Numer. Anal. 33 (1996) 1995-2016, corrected printing of sections 3-6 in ibid. 34 (1997) 853-866.
4. F.J. Hickernell, Quadrature error bounds with applications to lattice rules, SIAM J. Numer. Anal. 33 (1996) 1995-2016, corrected printing of sections 3-6 in ibid. 34 (1997) 853-866.
5. F.J. Hickernell, Lattice rules: How well do they measure up?, in: Pseudo- and Quasi-Random Point Sets, eds. P. Hellekalek and G. Larcher, Lecture Notes in Statistics, Vol. 138 (Springer, New York, 1998) pp. 109-166.
6. H.-H. Kuo, Gaussian Measures in Banach Spaces, Lectures Notes in Mathematics, Vol. 463 (Springer, Berlin, 1975).
7. J. Matoušek, The exponent of discrepancy is at least 1.0669, J. Complexity (1998) 448-453.
8. G.M. Molchan, On some problems concerning Brownian motion in Lévy's sense, Theory of Probab. Appl. 12 (1967) 682-690.
9. E. Novak, Intractability results for positive cubature formulas and extremal problems for trigonometric polynomials, J. Complexity 15 (1999) 299-316.
10. A. Papageorgiou and J.F. Traub, Beating Monte Carlo, Risk 9(6) (1996) 63-65.
11. S.H. Paskov and J.F. Traub, Faster valuation of financial derivatives, J. Portfolio Management 22 (1995) 113-120.
12. I.H. Sloan and S. Joe, Lattice Methods for Multiple Integration (Oxford University Press, Oxford, 1994).
13. I.H. Sloan and H. Woźniakowski, When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?, J. Complexity (1998) 1-33.
14. E.M. Stein, Singular Integrals and Differentiable Properties of Functions (Princeton University Press, Princeton, 1970).
15. C. Thomas-Agnan, Computing a family of reproducing kernels for statistical applications, Numer. Algorithms 13 (1996) 21-32.
16. J.F. Traub, G.W. Wasilkowski and H. Woźniakowski, Information-Based Complexity (Academic Press, New York, 1988).
17. G. Wahba, Spline Models for Observational Data, SIAM-NSF Regional Conference Series in Appl. Math., Vol. 59 (SIAM, Philadelphia, PA).
18. G.W. Wasilkowski, Integration and approximation of multivariate functions: Average case complexity with isotropic Wiener measure, Bull. Amer. Math. Soc. 28 (1993) 308-314; full version in J. Approx. Theory 77 (1994) 212-227.
19. G.W. Wasilkowski, Integration and approximation of multivariate functions: Average case complexity with isotropic Wiener measure, Bull. Amer. Math. Soc. 28 (1993) 308-314; full version in J. Approx. Theory 77 (1994) 212-227.
20. G.W. Wasilkowski and H. Woźniakowski, Explicit cost bounds of algorithms for multivariate tensor product problems, J. Complexity 11 (1995) 1-56.
21. G.W Wasilkowski and H. Woźniakowski, On tractability of path integration, J. Math. Phys. 37(4) (1996) 2071-2088.
22. G.W. Wasilkowski and H. Woźniakowski, The exponent of discrepancy is at most 1.4778. . . , Math. Comp. 66 (1997) 1125-1132.
23. G.W. Wasilkowski and H. Woźniakowski, Weighted tensor product algorithms for linear multivariate problems, J. Complexity 15 (1999) 402-447.
24. H. Woźniakowski, Average case complexity of linear multivariate problems. Part 1; Theory, Part 2: Applications, J. Complexity 8 (1992) 337-372; 373-392.
25. H. Woźniakowski, Tractability and strong tractability of linear multivariate problems, J. Complexity 10 (1994) 96-128.