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.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:swb:ch1-200600464 |
| Date | 05 April 2006 |
| Creators | Dahmen, Wolfgang, Harbrecht, Helmut, Schneider, Reinhold |
| Contributors | TU Chemnitz, SFB 393 |
| Publisher | Universitätsbibliothek Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:preprint |
| Format | text/html, text/plain, image/png, image/gif, text/plain, image/gif, application/pdf, application/x-gzip, text/plain, application/zip |
| Source | Preprintreihe des Chemnitzer SFB 393, 02-06 |
Page generated in 0.002 seconds