Till innehåll på sidan
Till KTH:s startsida Till KTH:s startsida

Robert Krasny: Fast Summation Methods Based on Barycentric Lagrange Interpolation

Tid: To 2022-11-03 kl 14.00 - 15.00

Plats: KTH, 3721, Lindstedsvägen 25

Medverkande: Robert Krasny

Exportera till kalender

Abstract:

Many problems in scientific computing involve long-range particle interactions, for example the Coulomb interaction of charged particles. To address the cost of computing these interactions in large-scale computations, we present two fast summation methods based on barycentric Lagrange interpolation, a treecode (BLTC) and a fast multipole method where the interaction lists are formed by dual tree traversal (BLDTT). The methods are kernel-independent, and the form of the approximation enables an efficient GPU implementation. The performance of the BLTC and BLDTT is demonstrated, and an application to the electrostatics of solvated biomolecules is presented.