Abstract

We are concerned with the sparse approximation of functions on the d-dimensional unit cube [0,1]d, which contain powers of distance functions to lower-dimensional k-faces (corners, edges, etc.). These functions arise, e.g., from corners, edges, etc., of domains in solutions to elliptic PDEs. Usually, they deteriorate the rate of convergence of numerical algorithms to approximate these solutions. We show that functions of this type can be approximated with respect to the H1 norm by sparse grid wavelet spaces VL, (VL) = NL, of biorthogonal spline wavelets of degree p essentially at the rate p: \[ \|u - P_Lu\|_{H^1([0,1]^d)} \leq CN_L^{-p}\,(\log_2 N_L)^s \|u\|, \qquad s = s(p,d), \] where || · || is a weighted Sobolev norm and PLu \in VL.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.