Art Werschulz: Online Publications
The following publications
are available online. Reports published in 2005 and later are available
as PDF files. Those published between 1998 and 2004 are available
as either compressed PostScript files or as PDF files. The older
ones (1997 and earlier) are only available as compressed PostScript
files.

Tractability of multivariate approximation over weighted
standard Sobolev spaces (with H. Wozniakowski).
Journal of
Complexity, Vol. 53, 2019, pp. 95112.
(https://doi.org/10.1016/j.jco.2018.10.008)

Tractability of approximation for some weighted spaces of
hybrid smoothness, in Contemporary Computational
Mathematics&emdash;A Celebration of the 80th Birthday of Ian
Sloan
(J.~Dick et al., editors), pp. 12151242. Springer
International Publishing~AG (part of Springer Nature), 2018.
(Invited paper.)

A new characterization of (s, t)weak tractability
(with H. Wozniakowski). Journal of Complexity,
Vol. 38, 2017, pp. 6889.
(http://dx.doi.org/10.1016/j.jco.2016.10.006)

A nearlyoptimal algorithm for the Fredholm problem of the
second kind over a nontensor product Sobolev space (with
H. Wozniakowski). Journal of Integral Equations and
Applications, Vol. 27, No. 1, Spring, 2015,
pp. 137152.

Tractability of the Fredholm problem of the second kind
(written with H. Wozniakowski).

Tractability of multivariate approximation over a weighted unanchored
Sobolev space: Smoothness sometimes hurts (written with
H. Wozniakwoski).

Tractability of the Helmholtz equation with nonhomogeneous Neumann
boundary conditions: Relation to $L_2$approximation.
 Complexity
and tractability of the heat equation.
 Tractability
of quasilinear problems. Part I: General Results (written with
H. Wozniakowski).
 Tractability
of quasilinear problems. Part II: Secondorder elliptic problems
(written with H. Wozniakowski).
 The complexity of Fredholm equations of the second kind: noisy
information about everything. Available as either
compressed PostScript or
PDF.
 An overview of informationbased complexity. Available as either
compressed PostScript or
PDF.
 Surface approximation is sometimes easier than surface integration
(written with H. Wozniakowski). Available as either
compressed PostScript or
PDF.
 Where does smoothness count the most for Fredholm equations of the
second kind with noisy information? Available as either
compressed PostScript or
PDF.
 What is the complexity of volume calculation? (written with H.
Wozniakowski). Available as either
compressed PostScript or
PDF.
 Informationbased complexity and informationbased optimization
(written with J. F. Traub). Available as either
compressed PostScript or
PDF.
 What is the complexity of surface integration? (written with
H. Wozniakowski). Available as either
compressed PostScript or
PDF.
 What is the complexity of Stieltjes integration? Available as
either
compressed PostScript or
PDF.

Where does smoothness count the most for twopoint boundaryvalue
problems?

The complexity of indefinite elliptic problems with noisy
data

The complexity of definite elliptic problems with noisy data

The complexity of the Poisson problem for spaces of bounded mixed
derivatives

What is the complexity of solutionrestricted operator
equations?

The complexity of multivariate elliptic problems with analytic
data

Linear illposed problems are solvable on the average (written
with J. F. Traub).
agw STRUDEL
cs.columbia.edu
Last modified: Mon Jul 8 10:11:28 2019