31,621 research outputs found

    Efficient high-order integral equation methods for the heat equation

    Get PDF
    Efficient high-order integral equation methods have been developed for solving the boundary value problems of the heat equation with complex geometries in two and three dimensions. First of all, the classical heat potential theory is applied to convert such problems to Volterra integral equations of the second kind via the heat layer potentials. Some advantages of the integral formulation as compared with standard finite difference and finite element methods include reduction of the dimension of the problem by one, high order accuracy, unconditional stability, insensitivity to different geometries, and elimination of truncating the computational domain and the need of artificial boundary conditions for exterior problems. However, the heat layer potentials contains convolution integrals in both space and time whose direct evaluation requires O(NS2NT2) work and O(NSNT) storage, where NS is the total number of discretization points in the spatial boundary and NT is the total number of time steps. This is excessively expensive even for problems of modest size, especially for three-dimensional problems. In order to evaluate the heat layer potentials accurately and efficiently, they are split into two parts - the local part which contains the temporal integration from t - δ to t and the history part which contains the temporal integration from 0 to t - δ. For the local part, Product integration is applied on the temporal integral to convert it to a sum of several spatial convolution integrals where the so-called local kernels have logarithmic singularity in two dimensions and 1r singularity in three dimensions. These weakly singular integrals are discretized via high-order quadratures and the resulting discrete summations can then be evaluated via fast algorithms such as the fast multipole method and its descendants. For the history part, efficient separated sum-of-exponentials approximations can be constructed for the heat kernel in any dimension. Specifically, 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 ) + log log(T δ ))) for any x Î R and δ ≤ t ≤ T, where E is the desired precision. In all higher dimensions, the corresponding heat kernel admits an approximation involving only O (log2(Tδ )) terms for fixed accuracy E. These approximations can be used to accelerate the evaluation of the history part of the heat layer potentials for stationary geometries. For two-dimensional problems with complex stationary geometries, the sum-of-exponentials approximation is used for the heat kernel and all local and history kernels are compressed only once. The resulting algorithm is very efficient with quasilinear complexity in both space and time for both interior and exterior problems. For two-dimensional problems with complex moving geometries, the spectral Fourier approximation is applied for the heat kernel and NUFFT is used to speed up the evaluation of the history part of the heat potentials. The complexity of the algorithm is again quasilinear in both space and time, albeit only for the interior problem. For three-dimensional problems, the sum-of-exponentials approximation is applied to speed up the evaluation of the history part. The singular surface integrals in the local kernels are treated with a spectrally accurate integrator. The algorithm is applicable for both interior and exterior problems and has quasilinear complexity with respect to the temporal variable. All these algorithms can be parallelized in a straightforward manner and their performance is demonstrated with extensive numerical experiments

    A SVD accelerated kernel-independent fast multipole method and its application to BEM

    Full text link
    The kernel-independent fast multipole method (KIFMM) proposed in [1] is of almost linear complexity. In the original KIFMM the time-consuming M2L translations are accelerated by FFT. However, when more equivalent points are used to achieve higher accuracy, the efficiency of the FFT approach tends to be lower because more auxiliary volume grid points have to be added. In this paper, all the translations of the KIFMM are accelerated by using the singular value decomposition (SVD) based on the low-rank property of the translating matrices. The acceleration of M2L is realized by first transforming the associated translating matrices into more compact form, and then using low-rank approximations. By using the transform matrices for M2L, the orders of the translating matrices in upward and downward passes are also reduced. The improved KIFMM is then applied to accelerate BEM. The performance of the proposed algorithms are demonstrated by three examples. Numerical results show that, compared with the original KIFMM, the present method can reduce about 40% of the iterating time and 25% of the memory requirement.Comment: 19 pages, 4 figure

    Fast integral equation methods for the modified Helmholtz equation

    Get PDF
    We present a collection of integral equation methods for the solution to the two-dimensional, modified Helmholtz equation, u(\x) - \alpha^2 \Delta u(\x) = 0, in bounded or unbounded multiply-connected domains. We consider both Dirichlet and Neumann problems. We derive well-conditioned Fredholm integral equations of the second kind, which are discretized using high-order, hybrid Gauss-trapezoid rules. Our fast multipole-based iterative solution procedure requires only O(N) or O(NlogN)O(N\log N) operations, where N is the number of nodes in the discretization of the boundary. We demonstrate the performance of the methods on several numerical examples.Comment: Published in Computers & Mathematics with Application

    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

    Fast integral equation methods for the Laplace-Beltrami equation on the sphere

    Full text link
    Integral equation methods for solving the Laplace-Beltrami equation on the unit sphere in the presence of multiple "islands" are presented. The surface of the sphere is first mapped to a multiply-connected region in the complex plane via a stereographic projection. After discretizing the integral equation, the resulting dense linear system is solved iteratively using the fast multipole method for the 2D Coulomb potential in order to calculate the matrix-vector products. This numerical scheme requires only O(N) operations, where NN is the number of nodes in the discretization of the boundary. The performance of the method is demonstrated on several examples
    corecore