Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generated
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 p≥1. 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 s. For N=0 return empty outputs. For N≥1, construct F and N 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 E with IE≠∅; 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 C form the particle-to-multipole (P2M) moments Mn(C)=∑j∈ICqj(zj−cC)n,0≤n≤p. For the upward multipole-to-multipole (M2M) pass, process nonempty internal cells bottom-up. For each such parent C and each 0≤n≤p, form its moments from its nonempty children by Mn(C)=∑E child of CIE≠∅∑r=0n(nr)(cE−cC)n−rMr(E). 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 (C,D) set δ=cD−cC, R=∣δ∣, choose the fixed logarithm LCD, and add to the target cell D's local coefficients the multipole-to-local (M2L) coefficients L0(D)+=M0(C)LCD(δ)−∑n=1pMn(C)nδn, Lk(D)+=(−1)k+1(M0(C)kδk+∑n=1p(n+k−1k)Mn(C)nδn+k),1≤k≤p. 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 D and each nonempty child E, add Lj(E)+=∑k=jp(kj)Lk(D)(cE−cD)k−j,0≤j≤p. For a target i in leaf D, return the far potential ∑k=0pLk(D)(zi−cD)k and far derivative ∑k=1pkLk(D)(zi−cD)k−1. Add the exact direct near contributions qjLji and qj/(zi−zj), respectively, for (j,i)∈N. Denote the resulting potential and derivative approximations by u~i and g~i, 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

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