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-dimensional… Expand

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 most… Expand

“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

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's… Expand

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 the… Expand

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 fixed… Expand