270 research outputs found

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

    Full text link
    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(Tδ)(log(1ϵ)+loglog(Tδ)))O(\log(\frac{T}{\delta}) (\log(\frac{1}{\epsilon})+\log\log(\frac{T}{\delta}))) for any x\in\bbR and δtT\delta \leq t \leq T, where ϵ\epsilon is the desired precision. In all higher dimensions, the corresponding heat kernel admits an approximation involving only O(log2(Tδ))O(\log^2(\frac{T}{\delta})) 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 NSN_S points in the spatial discretization and NTN_T time steps, the cost is O(NSNTlog2Tδ)O(N_S N_T \log^2 \frac{T}{\delta}) 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.Comment: 23 pages, 5 figures, 3 table

    Quadrature integration techniques for random hyperbolic PDE problems

    Get PDF
    In this paper, we consider random hyperbolic partial differential equation (PDE) problems following the mean square approach and Laplace transform technique. Randomness requires not only the computation of the approximating stochastic processes, but also its statistical moments. Hence, appropriate numerical methods should allow for the efficient computation of the expectation and variance. Here, we analyse different numerical methods around the inverse Laplace transform and its evaluation by using several integration techniques, including midpoint quadrature rule, Gauss?Laguerre quadrature and its extensions, and the Talbot algorithm. Simulations, numerical convergence, and computational process time with experiments are shown.This research has been funded by the Spanish Ministerio de Economía, Industria y Competitividad (MINECO), the Agencia Estatal de Investigación (AEI) and Fondo Europeo de Desarrollo Regional (FEDER UE) grant MTM2017-89664-
    corecore