Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Dahlke et al. (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: