Pith. sign in

REVIEW 1 cited by

An efficient data-driven solver for Fokker-Planck equations: algorithm and analysis

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1906.02600 v1 pith:X2FV2FF3 submitted 2019-06-06 math.NA cs.NAmath.DS

classification math.NAcs.NAmath.DS
keywords fokker-plancksolveralgorithmblockdata-drivenequationequationsstationary
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Computing the invariant probability measure of a randomly perturbed dynamical system usually means solving the stationary Fokker-Planck equation. This paper studies several key properties of a novel data-driven solver for low-dimensional Fokker-Planck equations proposed in [15]. Based on these results, we propose a new `block solver' for the stationary Fokker-Planck equation, which significantly improves the performance of the original algorithm. Some possible ways of reducing numerical artifacts caused by the block solver are discussed and tested with examples.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Artificial neural network solver for Fokker-Planck and Koopman eigenfunctions

    math.NA 2025-08 conditional novelty 6.0 of 10

    A data-driven ANN method estimates low-lying Fokker-Planck and Koopman eigenfunctions from Monte Carlo density relaxations, and is used to define a stochastic asymptotic phase for the noisy Lorenz system.

Pith tools