Tractability of Linear Multivariate Problems in the Average Case Setting
Authors:
- 1 January 2008
- book chapter
- Published by Springer Nature
- p. 461-493
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Lattice rule algorithms for multivariate approximation in the average case settingJournal of Complexity, 2008
- Quasi-Monte Carlo methods can be efficient for integration over products of spheresJournal of Complexity, 2004
- Finite-order weights imply tractability of linear multivariate problemsJournal of Approximation Theory, 2004
- Finite-order weights imply tractability of multivariate integrationJournal of Complexity, 2004
- When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals?Journal of Complexity, 1998
- Explicit Cost Bounds of Algorithms for Multivariate Tensor Product ProblemsJournal of Complexity, 1995
- Tractability and Strong Tractability of Linear Multivariate ProblemsJournal of Complexity, 1994
- Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measureBulletin of the American Mathematical Society, 1993
- On the average complexity of multivariate problemsJournal of Complexity, 1990
- Information of varying cardinalityJournal of Complexity, 1986