A Kernel-Independent Treecode for General Rotne-Prager-Yamakawa Tensor

A Kernel-Independent Treecode for General Rotne-Prager-Yamakawa Tensor

Year:    2021

Author:    Lei Wang

Advances in Applied Mathematics and Mechanics, Vol. 13 (2021), Iss. 2 : pp. 296–310

Abstract

A particle-cluster treecode based on barycentric Lagrange interpolation is presented for fast summation of hydrodynamic interactions through general Rotne-Prager-Yamakawa tensor in 3D. The interpolation nodes are taken to be Chebyshev points of the 2nd kind in each cluster. The barycentric Lagrange interpolation is scale-invariant that promotes the treecode's efficiency. Numerical results show that the treecode CPU time scales like $\mathcal{O}(N \log N)$, where $N$ is the number of beads in the system. The kernel-independent treecode is a relatively simple algorithm with low memory consumption, and this enables a straightforward OpenMP parallelization.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/10.4208/aamm.OA-2019-0322

Advances in Applied Mathematics and Mechanics, Vol. 13 (2021), Iss. 2 : pp. 296–310

Published online:    2021-01

AMS Subject Headings:    Global Science Press

Copyright:    COPYRIGHT: © Global Science Press

Pages:    15

Keywords:    General Rotne-Prager-Yamakawa tensor fast summation treecode barycentric Lagrange interpolation.

Author Details

Lei Wang

  1. Kernel aggregated fast multipole method

    Yan, Wen

    Blackwell, Robert

    Advances in Computational Mathematics, Vol. 47 (2021), Iss. 5

    https://doi.org/10.1007/s10444-021-09896-1 [Citations: 8]