## Abstract

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.