|
|
|
||||||||||
H. Harbrecht, TU Chemnitz, Germany
Wednesday, January 15
at 16.30
in HG E1.2
Solving a boundary integral equation by the Galerkin scheme leads to a densely populated system matrix which is often ill conditioned. Thus, the computation of the solution requires at least O(NJ2) operations, where NJ denotes the number of unknowns. This makes the boundary element method unattractive for the practical usage.
In the last years fast algorithms, like the Fast Multipole Method and the Panel Clustering, have been developed to reduce the complextity considerably. Another fast method is the wavelet Galerkin scheme: one employs biorthogonal wavelet bases with vanishing moments for the discretization of the given boundary integral equation. The resulting system matrix is quasi sparse and can be compressed without loss of accuracy to only O(NJ) nonzero entries.
In this talk we present the principles as well as new developments of the wavelet Galerkin scheme for boundary integral equations.
Wichtiger Hinweis:
Diese Website wird in älteren Versionen von Netscape ohne
graphische Elemente dargestellt. Die Funktionalität der
Website ist aber trotzdem gewährleistet. Wenn Sie diese
Website regelmässig benutzen, empfehlen wir Ihnen, auf
Ihrem Computer einen aktuellen Browser zu installieren. Weitere
Informationen finden Sie auf
folgender
Seite.
Important Note:
The content in this site is accessible to any browser or
Internet device, however, some graphics will display correctly
only in the newer versions of Netscape. To get the most out of
our site we suggest you upgrade to a newer browser.
More
information