We have decided to discontinue the publication of preprints on our preprint server end of 2024. The publication culture within mathematics has changed so much due to the rise of repositories such as ArXiV (www.arxiv.org) that we are encouraging all institute members to make their preprints available there. An institute's repository in its previous form is, therefore, unnecessary. The preprints published to date will remain available here, but we will not add any new preprints here.
In this paper we propose and analyse a new enhanced version of the panel-clustering algorithm for discrete boundary integral equations on polyhedral surfaces in 3D, which is designed to perform efficiently even when the meshes contain the highly stretched elements needed for efficient discretisation when the solution contains edge singularities. The key features of our algorithm are: (i) the employment of partial analytic integration in the direction of stretching, yielding a new kernel function on a one dimensional manifold where the influence of the high aspect ratios in the stretched elements is removed and (ii) the introduction of a generalised admissibility condition with respect to the partially integrated kernel which ensures that certain stretched clusters which are inadmissible in the classical sense now become admissible. In the context of a model problem, we prove that our algorithm yields an accurate (up to discretisation error) matrix-vector multiplication which requires