Return to search

Compression Techniques for Boundary Integral Equations - Optimal Complexity Estimates

In this paper matrix compression techniques in the
context of wavelet Galerkin schemes for boundary
integral equations are developed and analyzed that
exhibit optimal complexity in the following sense.
The fully discrete scheme produces approximate
solutions within discretization error accuracy
offered by the underlying Galerkin method at a
computational expense that is proven to stay
proportional to the number of unknowns.
Key issues are the second compression, that
reduces the near field complexity significantly,
and an additional a-posteriori compression.
The latter one is based on a general result
concerning an optimal work balance, that applies,
in particular, to the quadrature used to compute
the compressed stiffness matrix with sufficient
accuracy in linear time. The theoretical results
are illustrated by a 3D example on a nontrivial
domain.

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa.de:swb:ch1-200600464
Date05 April 2006
CreatorsDahmen, Wolfgang, Harbrecht, Helmut, Schneider, Reinhold
ContributorsTU Chemnitz, SFB 393
PublisherUniversitätsbibliothek Chemnitz
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typedoc-type:preprint
Formattext/html, text/plain, image/png, image/gif, text/plain, image/gif, application/pdf, application/x-gzip, text/plain, application/zip
SourcePreprintreihe des Chemnitzer SFB 393, 02-06

Page generated in 0.002 seconds