• Publications
  • Influence
High dimensional polynomial interpolation on sparse grids
TLDR
We study polynomial interpolation on a d-dimensional cube, where d is large. Expand
  • 602
  • 52
  • PDF
Tractability of Multivariate Problems
Multivariate problems occur in many applications. These problems are defined on spaces of d-variate functions and d can be huge – in the hundreds or even in the thousands. Some high-dimensionalExpand
  • 452
  • 41
  • PDF
Deterministic and Stochastic Error Bounds in Numerical Analysis
  • 321
  • 32
  • PDF
The inverse of the star-discrepancy depends linearly on the dimension
We study bounds on the classical ∗-discrepancy and on its inverse. Let n∞(d, e) be the inverse of the ∗-discrepancy, i.e., the minimal number of points in dimension d with the ∗-discrepancy at mostExpand
  • 119
  • 24
  • PDF
Special issue
TLDR
“Criminal Justice Drug Abuse Treatment Studies” (CJ- DATS) supports much of our corrections-based treatment research as part of the TCU CJ-DATS Project. Expand
  • 485
  • 23
  • PDF
High dimensional integration of smooth functions over cubes
Summary.We construct a new algorithm for the numerical integration of functions that are defined on a $d$-dimensional cube. It is based on the Clenshaw-Curtis rule for $d=1$ and on Smolyak'sExpand
  • 360
  • 20
Quantum Complexity of Integration
  • E. Novak
  • Computer Science, Physics
  • J. Complex.
  • 29 August 2000
It is known that quantum computers yield a speed-up for certain discrete problems. Here we want to know whether quantum computers are useful for continuous problems. We study the computation of theExpand
  • 76
  • 20
  • PDF
Simple Cubature Formulas with High Polynomial Exactness
Abstract. We study cubature formulas for d -dimensional integrals with arbitrary weight function of tensor product form. We present a construction that yields a high polynomial exactness: for fixedExpand
  • 258
  • 18
Global Optimization Using Hyperbolic Cross Points
TLDR
We propose a new numerical method for finding the global minimum of a real-valued function defined on a d-dimensional box. Expand
  • 41
  • 9
...
1
2
3
4
5
...