The randomized information complexity of elliptic PDE

Journal of Complexity

Volumn 22, Issue 2, 2006, Pages 220-249

  Heinrich, Stefan ^a  

^a University of Koblenz Landau   (Germany)

Author keywords

Elliptic partial differential equation; Information complexity; Lower bounds; Monte Carlo algorithm

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; PROBLEM SOLVING; RANDOM PROCESSES;

ELLIPTIC PARTIAL DIFFERENTIAL EQUATION; INFORMATION COMPLEXITY; MONTE CARLO ALGORITHM;

PARTIAL DIFFERENTIAL EQUATIONS;

EID: 31644445020     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2005.11.003     Document Type: Article

References (24)

1. S. Agmon, A. Douglis, and L. Nirenberg Estimates near the boundary for solutions of elliptic partial differential equations satisfying general boundary conditions: I Commun. Pure Appl. Math. 12 1959 623 727
2. S. Dahlke, E. Novak, W. Sickel, Optimal approximation of elliptic problems by linear and nonlinear mappings I, J. Complexity, to appear, see also the paper associated with the talk of E. Novak at: http://www.dagstuhl.de/04401/ Materials/
3. S. Dahlke, E. Novak, W. Sickel, Optimal approximation of elliptic problems by linear and nonlinear mappings II, preprint.
4. E.G. D'yakonov Optimization in Solving Elliptic Problems 1996 CRC Press Boca Raton, FL
5. S. Heinrich Lower bounds for the complexity of Monte Carlo function approximation J. Complexity 8 1992 277 300
6. S. Heinrich Random approximation in numerical analysis K.D. Bierstedt A. Pietsch W.M. Ruess D. Vogt Functional Analysis 1993 Marcel Dekker New York 123 171
7. S. Heinrich Quantum integration in Sobolev classes J. Complexity 19 2003 19 42 see also http://arXiv.org/abs/quant-ph/0112153
8. S. Heinrich Quantum approximation I, Embeddings of finite dimensional L p spaces J. Complexity 20 2004 5 26 see also http://arXiv.org/abs/quant-ph/ 0305030
9. S. Heinrich, Monte Carlo approximation of weakly singular integral operators, J. Complexity, in press, doi: 10.1016/j.jco.2005.11.002.
10. S. Heinrich, The quantum query complexity of elliptic PDE, in preparation.
11. Ju.P. Krasovskij, Investigation of potentials associated with boundary problems for elliptic equations, Izv. Akad. Nauk SSSR Ser. Mat. Tom 31(3) (1967) (in Russian)
12. English transl.: Math. USSR Izvestija 1(3) (1967) 569-622.
13. Ju. P. Krasovskij, Isolation of singularities of the Green's function, Izv. Akad. Nauk SSSR Ser. Mat. Tom 31(5) (1967) (in Russian)
14. English transl.: Math. USSR Izvestija 1(5) (1967) 935-966.
15. M. Kwas, Complexity of multivariate Feynman-Kac path integration in randomized and quantum settings, http://arXiv.org/abs/quant-ph/0410134.
16. M. Kwas, and Y. Li Worst case complexity of multivariate Feynman-Kac path integration J. Complexity 19 2003 730 743
17. P. Mathé, Approximation theory of stochastic numerical methods, Habilitation Thesis, 1994.
18. E. Novak, Deterministic and Stochastic Error Bounds in Numerical Analysis, Lecture Notes in Mathematics, vol. 1349, Springer, Berlin, 1988.
19. K. Petras, K. Ritter, On the complexity of parabolic initial value problems with variable drift, see the paper associated with the talk of K. Petras at http://www.dagstuhl.de/04401/Materials/
20. L. Plaskota, G.W. Wasilkowski, and H. Wozniakowski A new algorithm and worst case complexity for Feynman-Kac path integration J. Comput. Phys. 164 2000 335 353
21. J.F. Traub, G.W. Wasilkowski, and H. Woźniakowski Information-Based Complexity 1988 Academic Press New York
22. H. Wendland Local polynomial reproduction and moving least squares approximation IMA J. Numer. Anal. 21 2001 285 300
23. A.G. Werschulz The computational complexity of differential and integral equations, An Information-based Approach, Oxford Mathematical Monographs 1991 Oxford University Press Oxford
24. A.G. Werschulz The complexity of definite elliptic problems with noisy data J. Complexity 12 4 1996 440 473