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 2) while, for the classical panel clustering algorithm, it is O(nlog7 n).
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received July 28, 1999; revised September 21, 1999
Rights and permissions
About this article
Cite this article
Sauter, S. Variable Order Panel Clustering. Computing 64, 223–261 (2000). https://doi.org/10.1007/s006070050045
Issue Date:
DOI: https://doi.org/10.1007/s006070050045