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 (Formula Presented.) for any x∈ℝR and δ≤t≤T, where (Formula Presented.) is the desired precision. In all higher dimensions, the corresponding heat kernel admits an approximation involving only (Formula Presented.) terms for fixed accuracy (Formula Presented.). 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 (Formula Presented.) in terms of both memory and CPU time for fixed accuracy (Formula Presented.). The algorithms can be parallelized in a straightforward manner. Several numerical examples are presented to illustrate the accuracy and stability of these approximations.
All Science Journal Classification (ASJC) codes
- Computational Mathematics
- Applied Mathematics
- Heat kernels
- Heat potentials
- Inverse laplace transform
- Sum-of-exponentials approximation