A Note on the Complexity of Solving Poisson's Equation for Spaces of Bounded Mixed Derivatives

Journal of Complexity

Volumn 15, Issue 2, 1999, Pages 167-199

  Bungartz, Hans Joachim ^a   Griebel, Michael ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Poisson equation; complexity; sparse grids; finite element method; multilevel methods

Indexed keywords

EID: 0001335132     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1999.0499     Document Type: Article

References (46)

1. Babenko K. I. Approximation by trigonometric polynomials in a certain class of periodic functions of several variables. Dokl. Akad. Nauk SSSR. 132:1960;982-985.
2. Baszenski G., Delvos F.-J., Jester S. Blending approximation with sine functions. Braess D., Schumaker L. L. Numerical Methods of Approximation 9. Internat. Ser. Numer. Math. 105:1992;1-19 Birkhäuser, Basel.
3. Bramble J., Pasciak J. P., Xu J. Parallel multilevel preconditioners. Math. Comp. 55:1990;1-22.
4. Brandt A. Guide to multigrid development. Hackbusch W., Trottenberg U. Multigrid Methods. Lecture Notes in Mathematics. 960:1982;Springer-Verlag, Berlin/Heidelberg.
5. Bungartz H.-J. Dünne Gitter und deren Anwendung bei der adaptiven Lösung der dreidimensionalen Poisson-Gleichung. 1992;TU MünchenInstitut für Informatik.
6. Bungartz H.-J. An adaptive Poisson solver using hierarchical bases and sparse grids. de Groen P., Beauwens R. Iterative Methods in Linear Algebra. 1992;293-310 Elsevier, Amsterdam.
7. Bungartz H.-J. Finite Elements of Higher Order on Sparse Grids. 1998;TU MünchenInstitut für Informatik.
8. Bungartz H.-J., Dornseifer T. Sparse grids: recent developments for elliptic partial differential equations. Hackbusch W., Wittum G. Multigrid Methods V. Lecture Notes in Computational Science and Engineering. 3:1998;45-70 Springer-Verlag, Berlin/Heidelberg.
9. Bungartz H.-J., Dornseifer T., Zenger C. Tensor product approximation spaces for the efficient numerical solution of partial differential equations. Proc. Int. Workshop on Scientific Computations, Konya, 1996. 1998;Nova Science Publishers.
10. Dahmen W., Kunoth A. Multilevel preconditioning. Numer. Math. 63:1992;315-344.
11. Delvos F.-J. d-Variate Boolean interpolation. J. Approx. Theory. 34:1982;99-114.
12. Dendy J. Revenge of the semicoarsening frequency decomposition multigrid method. Melson D., Manteuffel T. A., McCormick S. F., Douglas C. C. Proc. 7th Copper Mountain Conference on Multigrid Methods. 1996;227-239 NASA CP 3339, Hampton.
13. Dendy J. Grandchild of the frequency decomposition multigrid method. SIAM J. Sci. Comput. 16:1995;307-319.
14. Faber G. Über stetige Funktionen. Math. Ann. 66:1909;81-94.
15. Gordon W. J. Distributive lattices and the approximation of multivariate functions. Schoenberg I. J. Approximation with Special Emphasis on Spline Functions. 1969;223-277 Academic Press, New York.
16. Griebel M. A parallelizable and vectorizable multi-level algorithm on sparse grids. Hackbusch W. Parallel Algorithms for Partial Differential Equations. Notes on Numerical Fluid Mechanics. 31:1991;Vieweg, Braunschweig/Wiesbaden.
17. Griebel M. Multilevelmethoden als Iterationsverfahren über Erzeugendensystemen. Teuber Skripten zur Numerik. 1994;Teubner, Stuttgart.
18. Griebel M., Huber W., Zenger C. Numerical turbulence simulation on a parallel computer using the combination method. Hirschel E. H. Flow Simulation on High- Performance Computers, II. Notes on Numerical Fluid Mechanics. 52:1996;Vieweg, Braunschweig/Wiesbaden.
19. M. Griebel, and, S. Knapek, Optimized approximation spaces for operator equations, Preprint No. 568, SFB 256, Universität Bonn, 1998.
20. Griebel M., Oswald P. On additive Schwarz preconditioners for sparse grid discretizations. Numer. Math. 66:1994;449-493.
21. Griebel M., Oswald P. Tensor product type subspace splittings and multilevel iterative methods for anisotropic problems. Adv. Comput. Math. 4:1995;171-206.
22. Griebel M., Schneider M., Zenger C. A combination technique for the solution of sparse grid problems. de Groen P., Beauwens R. Iterative Methods in Linear Algebra. 1992;263-281 Elsevier, Amsterdam.
23. Griebel M., Zenger C., Zimmer S. Multilevel Gauß-Seidel-algorithms for full and sparse grid problems. Computing. 50:1995;127-148.
24. Hackbusch W. Theorie und Numerik elliptischer Differentialgleichungen. Teubner Studienbücher Mathematik. 1986;Teubner, Stuttgart.
25. Hackbusch W. Multigrid Methods and Applications. 1985;Springer-Verlag, Berlin/Heidelberg.
26. Hackbusch W. The frequency decomposition multi-grid method. I. Application to anisotropic problems. Numer. Math. 56:1989;229-245.
27. Hackbusch W. The frequency decomposition multi-grid method. II. Analysis based on the additive Schwarz method. Numer. Math. 63:1992;433-453.
28. Hackbusch W. Iterative Solution of Large Sparse Systems of Equations. Applied Mathematical Sciences. 95:1993;Springer-Verlag, New York.
29. Hemker P. W. Sparse-grid finite-volume multigrid for 3D-problems. Adv. Comput. Math. 4:1995;83-110.
30. Hennart J. P., Mund E. H. On the h- and p-versions of the extrapolated Gordon's projector with applications to elliptic equations. SIAM J. Sci. Stat. Comput. 9:1988;773-791.
31. Kronsjö L., Dahlquist G. On the design of nested iterations for elliptic difference equations. BIT. 11:1971;63-71.
32. Martello S., Toth P. Knapsack Problems: Algorithms and Computer Implementations. 1990;Wiley, Chichester.
33. Mulder W. A. A new multigrid approach to convection problems. J. Comput. Phys. 83:1989;303-323.
34. Naik N., van Rosendale J. Report. 1991.
35. Oswald P. Multilevel Finite Element Approximation: Theory and Applications. Teubner Skripten zur Numerik. 1994;Teubner, Stuttgart.
36. Pflaum C. Diskretisierung elliptischer Differentialgleichungen mit dünnen Gittern. 1996;TU MünchenInstitut für Informatik.
37. Smolyak S. A. Quadrature and interpolation formulas for tensor products of certain classes of functions. Dokl. Akad. Nauk SSSR. 148:1963;1042-1045.
38. Stevenson R. Report. 1994.
39. Strang G., Fix G. J. An Analysis of the Finite Element Method. 1973;Prentice Hall, Englewood Cliffs.
40. Temlyakov V. N. On approximate recovery of functions with bounded mixed derivative. J. Complexity. 9:1993;41-59.
41. Traub J. F., Wasilkowski G. W., Wozniakowski H. Information-Based Complexity. 1988;Academic Press, New York.
42. Wasilkowski G. W., Wozniakowski H. Explicit cost bounds of algorithms for multivariate tensor products. J. Complexity. 11:1995;1-56.
43. Werschulz A. C. Technical Report. 1995.
44. Yserentant H. On the multi-level splitting of finite element spaces. Numer. Math. 49:1986;379-412.
45. Yserentant H. Hierarchical bases. O'Malley R. E. Jr. Proc. ICIAM91, Washington, 1991. 1992;SIAM, Philadelphia.
46. Zenger C. Sparse grids. Hackbusch W. Parallel Algorithms for Partial Differential Equations. Notes on Numerical Fluid Mechanics. 31:1991;Vieweg, Braunschweig.