Variable order panel clustering (extended version)

Stefan A. Sauter

Contact the author: Please use for correspondence this email.
Submission date: 20. Sep. 1999 (revised version: September 1999)
Pages: 53
published in: Computing, 64 (2000) 3, p. 223-261 
DOI number (of the published article): 10.1007/s006070050045
Bibtex
with the following different title: Variable order panel clustering
Download full preprint: PDF (658 kB), PS ziped (277 kB)

Abstract:
We present a new version of the panel clustering method for a sparse representation of boundary integral equations. Instead of applying the algorithm separately for each matrix row (as in the classical version of the algorithm) we employ more general block partitionings. Furthermore, a variable order of approximation is used depending on the size of blocks. We apply this algorithm to a second kind Fredholm integral equation and show that the complexity of the method only depends linearly on the number, say n, of unknowns. The complexity of the classical matrix oriented approach is O(n²) while, for the classical panel