Available in electronic format
Available in print format
Mathematics of Computation
Journal of the American Mathematical Society
ISSN 1088-6842(e) ISSN 0025-5718(p)
     

Tractability of quasilinear problems II: Second-order elliptic problems

Author(s): A. G. Werschulz; H. Wozniakowski.
Journal: Math. Comp. 76 (2007), 745-776.
MSC (2000): Primary 65N15; Secondary 41A65
Posted: November 30, 2006
Retrieve article in: PDF DVI PostScript

Abstract | References | Similar articles | Additional information

Abstract: In a previous paper, we developed a general framework for establishing tractability and strong tractability for quasilinear multivariate problems in the worst case setting. One important example of such a problem is the solution of the Helmholtz equation $ -\Delta u + qu = f$ in the $ d$-dimensional unit cube, in which $ u$ depends linearly on $ f$, but nonlinearly on $ q$. Here, both $ f$ and $ q$ are $ d$-variate functions from a reproducing kernel Hilbert space with finite-order weights of order $ \omega$. This means that, although $ d$ can be arbitrarily large, $ f$ and $ q$ can be decomposed as sums of functions of at most $ \omega$ variables, with $ \omega$ independent of $ d$.

In this paper, we apply our previous general results to the Helmholtz equation, subject to either Dirichlet or Neumann homogeneous boundary conditions. We study both the absolute and normalized error criteria. For all four possible combinations of boundary conditions and error criteria, we show that the problem is tractable. That is, the number of evaluations of $ f$ and $ q$ needed to obtain an $ \varepsilon $-approximation is polynomial in  $ \varepsilon ^{-1}$ and $ d$, with the degree of the polynomial depending linearly on $ \omega$. In addition, we want to know when the problem is strongly tractable, meaning that the dependence is polynomial only in  $ \varepsilon ^{-1}$, independently of $ d$. We show that if the sum of the weights defining the weighted reproducing kernel Hilbert space is uniformly bounded in $ d$ and the integral of the univariate kernel is positive, then the Helmholtz equation is strongly tractable for three of the four possible combinations of boundary conditions and error criteria, the only exception being the Dirichlet boundary condition under the normalized error criterion.


References:

1.
R. A. Adams and J. J. F. Fournier, Sobolev spaces, second ed., Pure and Applied Mathematics, vol. 140, Academic Press, Boston, 2003.

2.
N. Aronszajn, Theory of reproducing kernels, Trans. Amer. Math. Soc. 68 (1950), 337-404. MR 0051437 (14:479c)

3.
P. G. Ciarlet, Basic error estimates for elliptic problems, Handbook of Numerical Analysis, Vol. II, North-Holland, Amsterdam, 1991, pp. 17-351. MR 1115237

4.
J. Dick, I. H. Sloan, X. Wang, and H. Wozniakowski, Good lattice rules in weighted Korobov spaces with general weights, To appear in Numerische Mathematik.

5.
D. Gilbarg and N. S. Trudinger, Elliptic partial differential equations of second order, second ed., Grundlehren der mathematischen Wissenschaften, vol. 224, Springer-Verlag, Berlin, 1983. MR 0737190 (86c:35035)

6.
A. Messiah, Quantum mechanics, Dover, Mineola, NY, 1999.

7.
E. Novak and H. Wozniakowski, When are integration and discrepancy tractable?, Foundations of Computational Mathematics, Proceedings of Oxford 1999 (R. A. DeVore, A. Iserles, and E. Süli, eds.), Cambridge University Press, 2001, pp. 211-266. MR 1836619 (2002h:68083)

8.
J. T. Oden and J. N. Reddy, An introduction to the mathematical theory of finite elements, Wiley-Interscience, New York, 1976. MR 0461950 (57:1932)

9.
I. H. Sloan and H. Wozniakowski, When are quasi-Monte Carlo algorithms efficient for high-dimensional integrals?, J. Complexity 14 (1998), no. 1, 1-33.

10.
J. F. Traub, G. W. Wasilkowski, and H. Wozniakowski, Information-based complexity, Academic Press, Boston, 1988. MR 0958691 (90f:68085)

11.
J. F. Traub and A. G. Werschulz, Complexity and information, Cambridge University Press, Cambridge, 1998. MR 1692462 (2000m:65170)

12.
G. W. Wasilkowski and H. Wozniakowski, Finite-order weights imply tractability of linear multivariate problems, J. Approx. 130 (2004), 57-77. MR 2086810 (2005d:41048)

13.
A. G. Werschulz, The computational complexity of differential and integral equations: An information-based approach, Oxford University Press, New York, 1991. MR 1144521 (93a:68061)

14.
A. G. Werschulz and H. Wozniakowski, Tractability of quasilinear problems. I: General results, Tech. Report CUCS-025-05, Columbia University, Department of Computer Science, New York, 2005, Submitted to J. Approx. Theory for publication. Available at http://mice.cs.columbia.edu/getTechreport.php?techreportID=248&format=pdf&.

15.
William P. Ziemer, Weakly differentiable functions: Sobolev spaces and functions of bounded variation, Graduate Texts in Mathematics, vol. 120, Springer-Verlag, New York, 1989. MR 1014685 (91e:46046)


Similar Articles:

Retrieve articles in Mathematics of Computation with MSC (2000): 65N15, 41A65

Retrieve articles in all Journals with MSC (2000): 65N15, 41A65


Additional Information:

A. G. Werschulz
Affiliation: Department of Computer and Information Sciences, Fordham University, New York, New York 10023 and Department of Computer Science, Columbia University, New York, New York 10027
Email: agw@cs.columbia.edu

H. Wozniakowski
Affiliation: Department of Computer Science, Columbia University, New York, New York 10027 and Institute of Applied Mathematics, University of Warsaw, Poland
Email: henryk@cs.columbia.edu

DOI: 10.1090/S0025-5718-06-01927-2
PII: S 0025-5718(06)01927-2
Keywords: Complexity, tractability, high-dimensional problems, elliptic partial differential equations, reproducing kernel hilbert spaces, quasi-linear problems, finite-order weights
Received by editor(s): November 8, 2005
Received by editor(s) in revised form: January 17, 2006
Posted: November 30, 2006
Additional Notes: This research was supported in part by the National Science Foundation
Copyright of article: Copyright 2006, American Mathematical Society


  AMS Website Logo Small Comments: webmaster@ams.org
© Copyright 2008, American Mathematical Society
Privacy Statement
Search the AMSPowered by Google