2020
DOI: 10.1016/j.jcp.2019.108976
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of fast algorithms for global Quadrature by Expansion using target-specific expansions

Abstract: We develop an algorithm for the asymptotically fast evaluation of layer potentials close to and on the source geometry, combining Geometric Global Accelerated QBX ('GIGAQBX') and target-specific expansions. GIGAQBX is a fast high-order scheme for evaluation of layer potentials based on Quadrature by Expansion ('QBX') using local expansions formed via the Fast Multipole Method (FMM). Targetspecific expansions serve to lower the cost of local expansion evaluation, reducing the computational effort from O((p + 1)… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
24
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(25 citation statements)
references
References 28 publications
0
24
0
Order By: Relevance
“…A different approach that has been taken to accelerate QBX is to couple it to a customized FMM, which has been done in two dimensions [38][39][40] and more recently in three dimensions. 41,42 This coupling is a natural step to take since the FMM uses expansions of the same kind as QBX, but it requires nontrivial modifications to the FMM. The resulting method has complexity O(N) and works for any smooth geometry.…”
Section: Overview Of Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…A different approach that has been taken to accelerate QBX is to couple it to a customized FMM, which has been done in two dimensions [38][39][40] and more recently in three dimensions. 41,42 This coupling is a natural step to take since the FMM uses expansions of the same kind as QBX, but it requires nontrivial modifications to the FMM. The resulting method has complexity O(N) and works for any smooth geometry.…”
Section: Overview Of Related Workmentioning
confidence: 99%
“…This separation is necessary in the QBX-FMM methods, although target-specific expansions can also be used in QBX-FMM methods to lower the computational cost. 42 Some of the recent work have focused on automating the parameter selection based on a given error tolerance, resulting in the adaptive QBX method. 44 The results have so far not been generalized to three dimensions.…”
Section: Overview Of Related Workmentioning
confidence: 99%
“…where i = 0, 1, 2, 3 corresponds is the index of the quaternion and each of the vectors q (k,l) i are k th degree polynomials in r, which can be derived using quaternion product as (30) q…”
Section: Approximation Scheme Using Harmonic Polynomials and Quaterni...mentioning
confidence: 99%
“…quadrature-by-expansion (QBX) scheme, originally proposed in [3,14], the DLP is approximated at centers away from M using high-order local expansions, which are valid at points closer to or on M. Extension of QBX to three-dimensional problems was recently explored in [22,29,30]. A related algorithm is the hedgehog scheme of [18], which in turn is an extension of the earlier work by Ying et al [34].…”
mentioning
confidence: 99%
“…This approach is versatile and efficient due to only requiring discretization of RBCs and blood vessel surfaces, while achieving high-order convergence and optimal complexity implementation due to fast summation methods [21,38,43,44,47,48,59]. To solve elliptic partial differential equations, BIE approaches have been successful in several application domains [6,49,50,57]. However, to our knowledge, there has been no work combining a Stokes boundary solver on arbitrary complex geometries in 3d with a collision detection and resolution scheme to simulate RBC flows at large scale.…”
Section: Our Contributionsmentioning
confidence: 99%