Computing

, Volume 64, Issue 3, pp 223–261 | Cite as

Variable Order Panel Clustering

  • Stefan Sauter

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(n2) while, for the classical panel clustering algorithm, it is O(nlog7n).

AMS Subject Classifications: 65N38, 65R20, 65Y20. 
Key Words: Panel clustering method, variable order approximation, boundary integral equations. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Wien 2000

Authors and Affiliations

  • Stefan Sauter
    • 1
  1. 1.Institut für Mathematik Universität Zürich Winterthurerstr. 190 CH-8057 Zürich e-mail: stas@amath.unizh.chCH

Personalised recommendations