Evidence map›Paper›PMID 36415672›Full record

ArticleBIT. Numerical mathematics2022

Efficient numerical approximation of a non-regular Fokker-Planck equation associated with first-passage time distributions.

Udo Boehm, Sonja Cox, Gregor Gantner, Rob Stevenson

Abstract read
In one paragraph

Article in BIT. Numerical mathematics, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Udo BoehmDepartment of Psychology, University of Amsterdam, PO Box 15906, 1001 NK Amsterdam, The Netherlands.ORCID https://orcid.org/0000-0002-8677-0721
Sonja CoxKorteweg-de Vries (KdV) Institute for Mathematics, University of Amsterdam, PO Box 94248, 1090 GE Amsterdam, The Netherlands.ORCID https://orcid.org/0000-0002-9417-1542
Gregor GantnerInstitute of Analysis and Scientific Computing, TU Wien, Wiedner Hauptstraße 8-10, 1040 Vienna, Austria.ORCID 0000-0002-0324-5674
Rob StevensonKorteweg-de Vries (KdV) Institute for Mathematics, University of Amsterdam, PO Box 94248, 1090 GE Amsterdam, The Netherlands.ORCID https://orcid.org/0000-0001-7623-3060

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In neuroscience, the distribution of a decision time is modelled by means of a one-dimensional Fokker-Planck equation with time-dependent boundaries and space-time-dependent drift. Efficient approximation of the solution to this equation is required, e.g., for model evaluation and parameter fitting. However, the prescribed boundary conditions lead to a strong singularity and thus to slow convergence of numerical approximations. In this article we demonstrate that the solution can be related to the solution of a parabolic PDE on a rectangular space-time domain with homogeneous initial and boundary conditions by transformation and subtraction of a known function. We verify that the solution of the new PDE is indeed more regular than the solution of the original PDE and proceed to discretize the new PDE using a space-time minimal residual method. We also demonstrate that the solution depends analytically on the parameters determining the boundaries as well as the drift. This justifies the use of a sparse tensor product interpolation method to approximate the PDE solution for various parameter ranges. The predicted convergence rates of the minimal residual method and that of the interpolation method are supported by numerical simulations.

Indexed as

Fokker–Planck equationParameter-dependent PDESpace-time variational formulationSparse tensor product interpolationTime-dependent spatial domain

Identifiers

PMID36415672
PMCPMC9674775

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.