An optimal adaptive wavelet method for nonsymmetric and indefinite elliptic problems
作者:
Highlights:
•
摘要
In this paper, we modify the adaptive wavelet algorithm from Gantumur et al. [An optimal adaptive wavelet method without coarsening of the iterands, Technical Report 1325, Department of Mathematics, Utrecht University, March 2005, Math. Comp., to appear] so that it applies directly, i.e., without forming the normal equation, not only to self-adjoint elliptic operators but also to operators of the form L=A+B, where A is self-adjoint elliptic and B is compact, assuming that the resulting operator equation is well posed. We show that the algorithm has optimal computational complexity.
论文关键词:41A25,65J10,65N30,65N38,65T60,Adaptive methods,Strongly elliptic operators,Wavelets,Optimal computational complexity,Best N-term approximation
论文评审过程:Received 27 December 2005, Revised 2 November 2006, Available online 29 December 2006.
论文官网地址:https://doi.org/10.1016/j.cam.2006.11.013