Download PDF

Constructive Approximation

, 30:423 | Cite as

An Adaptive Wavelet Method for Solving High-Dimensional Elliptic PDEs

  • Tammo Jan Dijkema
  • Christoph Schwab
  • Rob Stevenson
Open Access
Article
First Online:
Received:
Revised:
Accepted:

Abstract

Adaptive tensor product wavelet methods are applied for solving Poisson’s equation, as well as anisotropic generalizations, in high space dimensions. It will be demonstrated that the resulting approximations converge in energy norm with the same rate as the best approximations from the span of the best N tensor product wavelets, where moreover the constant factor that we may lose is independent of the space dimension n. The cost of producing these approximations will be proportional to their length with a constant factor that may grow with n, but only linearly.

Keywords

Adaptive wavelet methods Best N-term approximations Tensor product approximation Sparse grids Matrix compression Optimal computational complexity 

Mathematics Subject Classification (2000)

41A25 41A63 42C40 46B28 65N30 
Download to read the full article text

References

  1. 1.
    Barinka, A.: Fast evaluation tools for adaptive wavelet schemes. PhD thesis, RTWH Aachen, March 2005 Google Scholar
  2. 2.
    Bungartz, H.J., Griebel, M.: Sparse grids. Acta Numer. 13, 147–269 (2004) CrossRefMathSciNetGoogle Scholar
  3. 3.
    Cohen, A.: Numerical Analysis of Wavelet Methods. Elsevier, Amsterdam (2003) MATHGoogle Scholar
  4. 4.
    Cohen, A., Dahmen, W., DeVore, R.: Adaptive wavelet methods for elliptic operator equations—convergence rates. Math. Comput. 70, 27–75 (2001) MATHMathSciNetGoogle Scholar
  5. 5.
    Cohen, A., Dahmen, W., DeVore, R.: Adaptive wavelet methods II—Beyond the elliptic case. Found. Comput. Math. 2(3), 203–245 (2002) MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Dahmen, W., Harbrecht, H., Schneider, R.: Compression techniques for boundary integral equations—optimal complexity estimates. SIAM J. Numer. Anal. 43(6), 2251–2271 (2006) MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Daubechies, I.: Orthonormal bases of compactly supported wavelets. Commun. Pure Appl. Math. 41, 909–996 (1988) MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Dauge, M.: Elliptic Boundary Value Problems on Corner Domain, Smoothness and Asymptotics of Solutions. Lecture Notes in Mathematics, vol. 1341. Springer, Berlin (1988) Google Scholar
  9. 9.
    DeVore, R.: Nonlinear approximation. Acta Numer. 7, 51–150 (1998) CrossRefMathSciNetGoogle Scholar
  10. 10.
    Dijkema, T.J.: Adaptive tensor product wavelet methods for solving PDEs. PhD thesis, Utrecht University (June 2009) Google Scholar
  11. 11.
    Donovan, G.C., Geronimo, J.S., Hardin, D.P.: Intertwining multiresolution analyses and the construction of piecewise-polynomial wavelets. SIAM J. Math. Anal. 27(6), 1791–1815 (1996) MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Donovan, G.C., Geronimo, J.S., Hardin, D.P.: Orthogonal polynomials and the construction of piecewise polynomial smooth wavelets. SIAM J. Math. Anal. 30(5), 1029–1056 (1999) MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Feynman, A.R., Hibbs, A.R.: Quantum Mechanics and Path Integrals. McGraw-Hill, New York (1965) MATHGoogle Scholar
  14. 14.
    Freidlin, M.: Functional Integration and Partial Differential Equations. Annals of Mathematics Studies, vol. 109. Princeton University Press, Princeton (1985) MATHGoogle Scholar
  15. 15.
    Gantumur, T., Stevenson, R.P.: Computation of differential operators in wavelet coordinates. Math. Comput. 75, 697–709 (2006) MATHMathSciNetGoogle Scholar
  16. 16.
    Gantumur, T., Harbrecht, H., Stevenson, R.P.: An optimal adaptive wavelet method without coarsening of the iterands. Math. Comput. 76, 615–629 (2007) MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Gavrilyuk, I.P., Hackbusch, W., Khoromskij, B.N.: Hierarchical tensor-product approximation to the inverse and related operators for high-dimensional elliptic problems. Computing 74(2), 131–157 (2005) MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Grasedyck, L.: Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure. Computing 72(3–4), 247–265 (2004) MATHMathSciNetGoogle Scholar
  19. 19.
    Greengard, L., Rokhlin, V.: A fast algorithm for particle simulation. J. Comput. Phys. 73, 325–348 (1987) MATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Griebel, M., Knapek, S.: Optimized tensor-product approximation spaces. Constr. Approx. 16(4), 525–540 (2000) MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Griebel, M., Oswald, P.: Tensor product type subspace splittings and multilevel iterative methods for anisotropic problems. Adv. Comput. Math. 4(1–2), 171–206 (1995) MATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Hackbusch, W.: Iterative Solution of Large Sparse Systems of Equations. Applied Mathematical Sciences, vol. 95. Springer, New York (1994) MATHGoogle Scholar
  23. 23.
    Hoang, V.H., Schwab, Ch.: High-dimensional finite elements for elliptic problems with multiple scales. SIAM J. Multiscale Model. Simul. 3(1), 168–194 (2005) MATHCrossRefMathSciNetGoogle Scholar
  24. 24.
    Metselaar, A.: Handling wavelet expansions in numerical methods. PhD thesis, University of Twente (2002) Google Scholar
  25. 25.
    Nitsche, P.-A.: Sparse approximation of singularity functions. Constr. Approx. 21(1), 63–81 (2005) MATHMathSciNetGoogle Scholar
  26. 26.
    Nitsche, P.-A.: Best N-term approximation spaces for tensor product wavelet bases. Constr. Approx. 24(1), 49–70 (2006) MATHCrossRefMathSciNetGoogle Scholar
  27. 27.
    Schwab, Ch., Stevenson, R.P.: Adaptive wavelet algorithms for elliptic PDEs on product domains. Math. Comput. 77, 71–92 (2008) MATHCrossRefMathSciNetGoogle Scholar
  28. 28.
    Todor, R.A., Schwab, Ch.: Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients. IMA J. Numer. Anal. 27(2), 232–261 (2007) MATHCrossRefMathSciNetGoogle Scholar
  29. 29.
    Yserentant, H.: Sparse grid spaces for the numerical solution of the electronic Schrödinger equation. Numer. Math. 101(2), 381–389 (2005) MATHCrossRefMathSciNetGoogle Scholar
  30. 30.
    Zenger, Ch.: Sparse grids. In: Parallel Algorithms for Partial Differential Equations, Kiel, 1990. Notes Numer. Fluid Mech., vol. 31, pp. 241–251. Vieweg, Braunschweig (1991) Google Scholar

Copyright information

© The Author(s) 2009

Authors and Affiliations

  • Tammo Jan Dijkema
    • 1
  • Christoph Schwab
    • 2
  • Rob Stevenson
    • 3
  1. 1.Department of MathematicsUtrecht UniversityUtrechtThe Netherlands
  2. 2.Seminar for Applied Mathematics, ETHZ HG G58.1ETH ZürichZürichSwitzerland
  3. 3.Korteweg-de Vries Institute for MathematicsUniversity of AmsterdamAmsterdamThe Netherlands

Personalised recommendations