Full text not available from this repository.
In many cases, boundary value problems on a domain Ω can be rewritten as integral equations on the boundary of Ω. The discretization of this integral equation leads to a system of linear equations with a dense coefficient matrix of dimension N. In this paper, we present a panel clustering algorithm which avoids the generation of the N2 matrix entries by representing the integral operator on the discrete level by only O(NlogκN) quantities. Thus, a matrix vector multiplication as a basis step in every iterative solver can be performed by O(NlogκN) operations. This method can be applied to all kinds of integral equations discretized by, e.g., the Nyström, the collocation or the Galerkin method.
|Other titles:||Proceedings of the IMA Workshops on Wavelets, Multigrid and Other Fast Algorithms (Multiple, FFT) and Their Use in Wave Propagation and Waves in Random and Other Complex Media held at the University of Minnesota, Minneapolis, MN, 1994.|
|Item Type:||Book Section, refereed, original work|
|Communities & Collections:||07 Faculty of Science > Institute of Mathematics|
|Deposited On:||29 Nov 2010 16:28|
|Last Modified:||04 Apr 2012 12:55|
|Series Name:||The IMA Volumes in Mathematics and its Applications|
Users (please log in): suggest update or correction for this item
Repository Staff Only: item control page