Adaptive Solution of Operator Equations Using Wavelet Frames
- 1 January 2003
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 41 (3), 1074-1100
- https://doi.org/10.1137/s0036142902407988
Abstract
In "Adaptive wavelet methods II---Beyond the elliptic case" of Cohen, Dahmen, and DeVore [Found. Comput. Math., 2 (2002), pp. 203--245], an adaptive method has been developed for solving general operator equations. Using a Riesz basis of wavelet type for the energy space, the operator equation is transformed into an equivalent matrix-vector system. This system is solved iteratively, where the application of the infinite stiffness matrix is replaced by an adaptive approximation. Assuming that the stiffness matrix is sufficiently compressible, i.e., that it can be sufficiently well approximated by sparse matrices, it was proved that the adaptive method has optimal computational complexity in the sense that it converges with the same rate as the best N-term approximation for the solution, assuming that the latter would be explicitly available. The condition concerning compressibility requires that, dependent on their order, the wavelets have sufficiently many vanishing moments, and that they be sufficiently smooth. However, except on tensor product domains, wavelets that satisfy this smoothness requirement are not easy to construct.In this paper we write the domain or manifold on which the operator equation is posed as an overlapping union of subdomains, each of them being the image under a smooth parametrization of the hypercube. By lifting wavelets on the hypercube to the subdomains, we obtain a {\em frame} for the energy space. With this frame the operator equation is transformed into a matrix-vector system, after which this system is solved iteratively by an adaptive method similar to the one from the work of Cohen, Dahmen, and DeVore. With this approach, frame elements that have sufficiently many vanishing moments and are sufficiently smooth, something needed for the compressibility, are easily constructed. By handling additional difficulties due to the fact that a frame gives rise to an underdetermined matrix-vector system, we prove that this adaptive method has optimal computational complexity.Keywords
This publication has 14 references indexed in Scilit:
- Adaptive Wavelet Methods II—Beyond the Elliptic CaseFoundations of Computational Mathematics, 2002
- Adaptive Wavelet Methods for Saddle Point Problems---Optimal Convergence RatesSIAM Journal on Numerical Analysis, 2002
- Wavelet adaptive method for second order elliptic problems: boundary conditions and domain decompositionNumerische Mathematik, 2000
- Adaptive wavelet methods for elliptic operator equations: Convergence ratesMathematics of Computation, 2000
- Besov regularity for elliptic boundary value problems in polygonal domainsApplied Mathematics Letters, 1999
- Biorthogonal Spline Wavelets on the Interval—Stability and Moment ConditionsApplied and Computational Harmonic Analysis, 1999
- The Wavelet Element Method: Part I. Construction and AnalysisApplied and Computational Harmonic Analysis, 1999
- Stable multiscale bases and local error estimation for elliptic problemsApplied Numerical Mathematics, 1997
- Besov regularity for elliptic boundary value problemsCommunications in Partial Differential Equations, 1997
- Interpolation SpacesPublished by Springer Science and Business Media LLC ,1976