Abstract
This paper is concerned with the development of adaptive numerical methods for elliptic operator equations. We are particularly interested in discretization schemes based on wavelet frames. We show that by using three basic subroutines an implementable, convergent scheme can be derived, which, moreover, has optimal computational complexity. The scheme is based on adaptive steepest descent iterations. We illustrate our findings by numerical results for the computation of solutions of the Poisson equation with limited Sobolev smoothness on intervals in 1D and L-shaped domains in 2D. The author 2007. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.2007
| Original language | English |
|---|---|
| Pages (from-to) | 717-740 |
| Number of pages | 24 |
| Journal | IMA Journal of Numerical Analysis |
| Volume | 27 |
| Issue number | 4 |
| DOIs | |
| State | Published - Oct 2007 |
| Externally published | Yes |
Keywords
- Adaptive algorithms
- Banach frames
- Multiscale methods
- Norm equivalences
- Operator equations
- Sparse matrices
Fingerprint
Dive into the research topics of 'Adaptive frame methods for elliptic operator equations: The steepest descent approach'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver