H. Wozniakowski

Publications
Influence

When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals?

I. Sloan, H. Wozniakowski
Computer Science, Mathematics
J. Complex.
1 March 1998

This paper presents a partial answer to why quasi-Monte Carlo algorithms can work well for arbitrarily larged. Expand

E. Novak, H. Wozniakowski
Mathematics
2 September 2008

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

Explicit Cost Bounds of Algorithms for Multivariate Tensor Product Problems

G. Wasilkowski, H. Wozniakowski
Computer Science, Mathematics
J. Complex.
1 March 1995

We study multivariate tenser product problems in the worst case and average case settings. Expand

The inverse of the star-discrepancy depends linearly on the dimension

S. Heinrich, H. Wozniakowski, G. Wasilkowski, E. Novak
Mathematics
2001

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

Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start

J. Kuczynski, H. Wozniakowski
Mathematics, Computer Science
SIAM J. Matrix Anal. Appl.
1 October 1992

This paper addresses the problem of computing an approximation to the largest eigenvalue of an $n \times n$ large symmetric positive definite matrix with relative error at most $\varepsilon $. Expand

Tractability of Multivariate Problems Volume II: Standard Information for Functionals

E. Novak, H. Wozniakowski
Mathematics
3 July 2010

A general theory of optimal algorithms

J. Traub, H. Wozniakowski
Computer Science
ACM monograph series
1980

By reading, you can know the knowledge and things more, not only about what you get from people to people. Expand

Information-based complexity

J. Traub, G. Wasilkowski, H. Wozniakowski
Computer Science, Medicine
Nature
1 July 1987

Information-based complexity seeks to develop general results about the intrinsic difficulty of solving problems where available information is partial or approximate and to apply these results to specific problems. Expand

Convergence and Complexity of Newton Iteration for Operator Equations

J. Traub, H. Wozniakowski
Mathematics, Computer Science
JACM
1 April 1979

An optimal convergence condition for Newton iteration in a Banach space is established. Expand

Average case complexity of multivariate integration

H. Wozniakowski
Mathematics
1991

We study the average case complexity of multivariate integration for the class of continuous functions of d variables equipped with the classical Wiener sheet measure. To derive the average case… Expand

Recommended Authors