Efficient sum-of-exponentials approximations for the heat kernel and their applications

From MaRDI portal
Publication:2355178




Abstract: In this paper, we show that efficient separated sum-of-exponentials approximations can be constructed for the heat kernel in any dimension. In one space dimension, the heat kernel admits an approximation involving a number of terms that is of the order O(log(fracTdelta)(log(frac1epsilon)+loglog(fracTdelta))) for any and deltaleqtleqT, where epsilon is the desired precision. In all higher dimensions, the corresponding heat kernel admits an approximation involving only O(log2(fracTdelta)) terms for fixed accuracy epsilon. These approximations can be used to accelerate integral equation-based methods for boundary value problems governed by the heat equation in complex geometry. The resulting algorithms are nearly optimal. For NS points in the spatial discretization and NT time steps, the cost is O(NSNTlog2fracTdelta) in terms of both memory and CPU time for fixed accuracy epsilon. The algorithms can be parallelized in a straightforward manner. Several numerical examples are presented to illustrate the accuracy and stability of these approximations.



Cites work


Cited in
(18)






This page was built for publication: Efficient sum-of-exponentials approximations for the heat kernel and their applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355178)