The DOI matches its Crossref record.
The Fast Gauss Transform
Open accessAbstract
Many problems in applied mathematics require the evaluation of the sum of N Gaussians at M points in space. The work required for direct evaluation grows like $NM$ as N and M increase; this makes it very expensive to carry out such calculations on a large scale. In this paper, an algorithm is presented which evaluates the sum of N Gaussians at M arbitrarily distributed points in $C \cdot (N + M)$ work, where C depends only on the precision required. When $N = M = 100,000$, the algorithm presented here is several thousand times faster than direct evaluation. It is based on a divide-and-conquer strategy, combined with the manipulation of Hermite expansions and Taylor series.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Point Set Registration: Coherent Point Drift
Myronenko, A., & Song, X. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.46 · Cited by 2,762
Image Segmentation Using Active Contours Driven by the Bhattacharyya Gradient Flow
Michailovich, O., Rathi, Y., & Tannenbaum, A. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.908073 · Cited by 320
Giantomassi, A., Ferracuti, F., Iarlori, S., Ippoliti, G., & Longhi, S. (2015) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2014.2370936 · Cited by 168
A new method for the registration of three-dimensional point-sets: The Gaussian Fields framework
Boughorbel, F., Mercimek, M., Koschan, A., & Abidi, M. (2010) · Image and Vision Computing · doi:10.1016/j.imavis.2009.05.003 · Cited by 31
Zhang, J., Nolte, N., Sadhukhan, R., Chen, B., & Bottou, L. (2024) · arXiv · doi:10.48550/arxiv.2405.06394 · Cited by 10
“One time step later, the input x T +1 is revealed, the value v T can be computed, and the pair ( k T , v T ) is added to the memory.”
Metadata
- Authors
- Greengard, L., & Strain, J.
- Venue
- SIAM Journal on Scientific and Statistical Computing
- Published
- 1991-01
- Volume
- 12
- Issue
- 1
- Pages
- 79-94
- ISSN
- 0196-5204 (ISSN-L)
- 2168-3417
- OpenAlex
- W2160431995
- Cited by
- 491
- References
- 0
- FWCI
- 2.06
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Fast Gauss Transform. https://app.cochat.ai/papers/10.1137/0912004
- The paper
- Greengard, L., & Strain, J. (1991). The Fast Gauss Transform. SIAM Journal on Scientific and Statistical Computing. https://doi.org/10.1137/0912004
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.