How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Fixed-order planar Laplace fast multipole procedure
Definition
Use the data, quadtree and interaction decomposition of Finite planar quadtree and separated interaction lists. Fix an expansion order . If two different labels have the same position, return status collision before evaluating any singular interaction: the requested potential is undefined. Otherwise take as input a finite quadtree from the definition, together with its point-to-cell membership arrays and leaf threshold . For return empty outputs. For , construct and by the recursive decomposition in the definition. The tree and point-to-cell membership are preprocessing inputs; their construction is not part of the arithmetic passes below.
Using the supplied membership data, make a root-first list of nonempty cells: at each nonempty internal cell inspect its four children and recurse only into children with ; never descend into an empty subtree. Use the reverse list order for the bottom-up pass and the root-first order for the top-down pass. Use exact complex arithmetic throughout. For each nonempty leaf form the particle-to-multipole (P2M) moments For the upward multipole-to-multipole (M2M) pass, process nonempty internal cells bottom-up. For each such parent and each , form its moments from its nonempty children by An empty child has zero moments and is skipped. Thus the upward pass visits only parent-child edges whose two cells are nonempty.
Initialize the local coefficient vector of every nonempty cell to zero before processing any far pair. For each far pair set , , choose the fixed logarithm , and add to the target cell 's local coefficients the multipole-to-local (M2L) coefficients After all M2L additions, perform a top-down downward local-to-local (L2L) pass over parent-child edges whose two cells are nonempty. For each parent and each nonempty child , add For a target in leaf , return the far potential and far derivative . Add the exact direct near contributions and , respectively, for . Denote the resulting potential and derivative approximations by and , respectively. The derivative output differentiates the truncated local polynomial and adds the exact near derivatives; its value is independent of logarithm branches.
Depends on
Used by
- A clustered point set makes tree depth enter the work Example
- Near/far split with exact near evaluation and truncated far error Example
- Two separated planar charge clusters Example
- Planar Laplace multipole and local translation identities Lemma
- Global planar FMM potential and derivative error Theorem
- Planar FMM operation count under explicit linear-size tree and list bounds Theorem
Dependency tree · one level
1 result within one dependency step of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Leslie Greengard and Vladimir Rokhlin, A Fast Algorithm for Particle Simulations, Journal of Computational Physics 73 (1987), 325–348 (standard reference, not scraped)
- James Demmel, Fast Hierarchical Methods for the N-body Problem, Part 2, CS267 Lecture 25 (1996) (standard reference, not scraped)