Köln, Universiẗat, Diss., 1996.

This paper is intended to present wavelet Galerkin schemes for the boundary element method. Wavelet Galerkin schemes employ appropriate wavelet bases for the discretization of boundary integral operators. This yields quasisparse system matrices which can be compressed to O(N_J) relevant matrix entries without compromising the accuracy of the underlying Galerkin scheme. Herein, O(N_J) denotes the number of unknowns. The assembly of the compressed system matrix can be performed in O(N_J) operations. Therefore, we arrive at an algorithm which solves boundary integral equations within optimal complexity. By numerical experiments we provide results which corroborate the theory.

Chemnitz, Techn. Univ., Diss., 2006.

Techn. University, Diss., 2001--Darmstadt.

Universiẗat, Diss., 2001--Dortmund.

Universiẗat, Diss., 2004--Bremen.

In this thesis we deal with the degree of ill-posedness of linear operator equations in Hilbert spaces, where the operator may be decomposed into a compact linear integral operator with a well-known decay rate of singular values and a multiplication operator. This case occurs for example for nonlinear operator equations, where the local degree of ill-posedness is investigated via the Frechet derivative. If the multiplier function has got zeroes, the determination of the local degree of ill-posedness is not trivial. We are going to investigate this situation, provide analytical tools as well as their limitations. By using several numerical approaches for computing the singular values of the operator we find that the degree of ill-posedness does not change through those multiplication operators. We even provide a conjecture, verified by several numerical studies, how these multiplication operators influence the singular values of the operator equation. Finally we analyze the influence of those multiplication operators on the opportunities of Tikhonov regularization and corresponding convergence rates. In this context we also provide a short summary on the relationship between nonlinear problems and their linearizations. / Diese Arbeit beschaeftigt sich mit dem Grad der Inkorrektheit linearer Operatorgleichungen in Hilbertraeumen, die sich als Komposition eines vollstetigen linearen Integraloperators mit bekannter Abklingrate der Singulaerwerte und eines Multiplikationsoperators darstellen lassen. Dieser Fall tritt beispielsweise bei nichtlinearen Operatorgleichungen auf, wobei der lokale Inkorrektheitsgrad ueber die Frechetableitung bestimmt wird. Falls die Multiplikatorfunktion Nullstellen hat, so ist die Bestimmung des lokalen Grades der Inkorrektheit nicht einfach. Moeglichkeiten und Grenzen der Analysis fuer diese Situation werden betrachtet. Unterschiedliche numerische Ansaetze fuer die Bestimmung der Singulaerwerte liefern, dass der Grad der Inkorrektheit durch die Multiplikationsoperatoren nicht veraendert wird. Es wird sogar ein Zusammenhang angegeben, wie Multiplikationsoperatoren die Singulaerwerte beeinflussen. Schliesslich werden Moeglichkeiten der Tikhonov-Regularisierung unter Einfluss der Multiplikationsoperatoren untersucht. In diesem Zusammenhang wird auch eine kurze Zusammenfassung zur Beziehung von nichtlinearen Problemen und ihren Linearisierungen gegeben.

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.

This document serves as a reference for the beta version of our evaluation library ITL. First, it describes a library which gives an easy way for programmers to evaluate the 3D image and the normal vector corresponding to a parameter value which belongs to the unit square. The API functions which are described in this document let programmers make those evaluations without the need to understand the underlying CAD complica- tions. As a consequence, programmers can concentrate on their own scien- tific interests. Our second objective is to describe the input which is a set of parametric four-sided surfaces that have the structure required by some integral equation solvers.

We focus on the programming aspect of the treatment of digitized geometries for subsequent use in mesh-free and mesh-based numerical solvers. That perspective includes the description of our C/C++ implementations which use OpenGL for the visualization and MFC classes for the user interface. We report on our experience about implementing with the IGES interface which serves as input for storage of geometric information. For mesh-free numerical solvers, it is helpful to decompose the boundary of a given solid into a set of four-sided surfaces. Additionally, we will describe the treatment of diffeomorphisms on four-sided domains by using transfinite interpolations. In particular, Coons and Gordon patches are appropriate for dealing with such mappings when the equations of the delineating curves are explicitly known. On the other hand, we show the implementation of the mesh generation algorithms which invoke the Laplace-Beltrami operator. We start from coarse meshes which one refine according to generalized Delaunay techniques. Our software is also featured by its ability of treating assembly of solids in B-Rep scheme.