[工程科技]Computation of singular integral operators in wavelet coordinates.pdfVIP

Computation of singular integral operators in wavelet coordinates T. Gantumur, Utrecht, and R.P. Stevenson, Utrecht June 15, 2005 Abstract With respect to a wavelet basis, singular integral operators can be well approximated by sparse matrices, and in [Found. Comput. Math., 2 (2002), pp. 203–245] and [SIAM J. Math. Anal., 35 (2004), pp. 1110–1132], this property was used to prove certain optimal complex- ity results in the context of adaptive wavelet methods. These results, however, were based upon the assumption that, on average, each entry of the approximating sparse matrices can be computed at unit cost. In this paper, we confirm this assumption by carefully distributing com- putational costs over the matrix entries in combination with choosing efficient quadrature schemes. AMS Subject Classification: 41A25, 47A20, 65D30, 65F50, 65N38 Key words: Wavelets, adaptivity, boundary integral operators, matrix com- pression, numerical integration, singular integrals, nearly singular integrals, optimal computational complexity 1 Introduction Boundary integral methods reduce elliptic boundary value problems in do- mains to integral equations formulated on the boundary of the domain. Although the dimension of the underlying manifold decreases by one, the fi- nite element discretization of the resulting boundary integral equations gives densely populated stiffness matrices, causing serious obstructions to accurate numerical solution processes. In order to overcome this difficulty, various successful approaches for approximating the stiffness matrix by sparse ones have been developed, such as multipole expansions, panel clustering, and wavelet compression, see e.g. [Atk97, Hac95]. We will restrict ourselves here to the