The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
The Implicit Closest Point Method for the Numerical Solution of Partial Differential Equations on Surfaces
Abstract
Many applications in the natural and applied sciences require the solutions of partial differential equations (PDEs) on surfaces or more general manifolds. The closest point method is a simple and accurate embedding method for numerically approximating PDEs on rather general smooth surfaces. However, the original formulation is designed to use explicit time stepping. This may lead to a strict time-step restriction for some important PDEs such as those involving the Laplace–Beltrami operator or higher-order derivative operators. To achieve improved stability and efficiency, we introduce a new implicit closest point method for surface PDEs. The method allows for large, stable time steps while retaining the principal benefits of the original method. In particular, it maintains the order of accuracy of the discretization of the underlying embedding PDE, it works on sharply defined bands without degrading the accuracy of the method, and it applies to general smooth surfaces. It also is very simple and may be applied to a rather general class of surface PDEs. Convergence studies for the in-surface heat equation and a fourth-order biharmonic problem are given to illustrate the accuracy of the method. We demonstrate the flexibility and generality of the method by treating flows involving diffusion, reaction-diffusion, and fourth-order spatial derivatives on a variety of interesting surfaces including surfaces of mixed codimension.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
The chemical basis of morphogenesis
Turing, A. M. (1952) · Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences · doi:10.1098/rstb.1952.0012 · Cited by 11,733 · cited 1×
“where f and g are nonlinear reaction terms [39].”
BackgroundPython for scientific computing
Oliphant, T. E. (2007) · Computing in Science & Engineering · doi:10.1109/mcse.2007.58 · Cited by 3,303 · cited 1×
“The computations in this section were performed in Python [42] using SciPy [20] and NumPy [26] for numerical calculations.”
Method
Cited by
Finite element methods for surface PDEs
Dziuk, G., & Elliott, C. M. (2013) · Acta Numerica · doi:10.1017/s0962492913000056 · Cited by 635
Metadata
- Authors
- Macdonald, C. B., & Ruuth, S. J.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2010-01
- Volume
- 31
- Issue
- 6
- Pages
- 4330-4350
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2123996636
- Cited by
- 180
- References
- 2
- FWCI
- 5.40
- Type
- journal article
- Language
- en
- Open access
- closed
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 Implicit Closest Point Method for the Numerical Solution of Partial Differential Equations on Surfaces. https://app.cochat.ai/papers/10.1137/080740003
- The paper
- Macdonald, C. B., & Ruuth, S. J. (2010). The Implicit Closest Point Method for the Numerical Solution of Partial Differential Equations on Surfaces. SIAM Journal on Scientific Computing. https://doi.org/10.1137/080740003
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.