2015
DOI: 10.48550/arxiv.1506.02470
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Large-time behavior in non-symmetric Fokker-Planck equations

Abstract: We consider three classes of linear non-symmetric Fokker-Planck equations having a unique steady state and establish exponential convergence of solutions towards the steady state with explicit (estimates of) decay rates. First, "hypocoercive" Fokker-Planck equations are degenerate parabolic equations such that the entropy method to study large-time behavior of solutions has to be modified. We review a recent modified entropy method (for nonsymmetric Fokker-Planck equations with drift terms that are linear in t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 32 publications
(79 reference statements)
0
3
0
Order By: Relevance
“…This collocation method relies on a choice of basis functions (usually polynomials up to a certain degree) to represent the exact solution, and uses a nonlinear solver per uHMC transition step. General complexity guarantees are given for their ODE solvers, and as an application of their ideas to Hamiltonian MCMC, they consider the special case of a basis of piecewise quadratic polynomials defined on a time grid of step size h. In this case, uHMC with collocation can in principle produce an ε-accurate approximation of the target µ in W 2 distance using (1) when initialized at the minimum of U and run with duration T ∝ K 1 4 L 3 4 . In each transition step of uHMC, h is chosen to satisfy h −1 ∝ LT 3 ( v + ∇U (x) T )K 1 2 (L K) 3 2 ε −1 , where x, v ∈ R d are respectively the initial position and velocity in the current transition step.…”
Section: State Of the Artmentioning
confidence: 99%
See 2 more Smart Citations
“…This collocation method relies on a choice of basis functions (usually polynomials up to a certain degree) to represent the exact solution, and uses a nonlinear solver per uHMC transition step. General complexity guarantees are given for their ODE solvers, and as an application of their ideas to Hamiltonian MCMC, they consider the special case of a basis of piecewise quadratic polynomials defined on a time grid of step size h. In this case, uHMC with collocation can in principle produce an ε-accurate approximation of the target µ in W 2 distance using (1) when initialized at the minimum of U and run with duration T ∝ K 1 4 L 3 4 . In each transition step of uHMC, h is chosen to satisfy h −1 ∝ LT 3 ( v + ∇U (x) T )K 1 2 (L K) 3 2 ε −1 , where x, v ∈ R d are respectively the initial position and velocity in the current transition step.…”
Section: State Of the Artmentioning
confidence: 99%
“…However, since in uHMC we are almost exclusively interested in a stochastic notion of accuracy of the numerical time integration [8, Theorem 3.6], it is quite natural to instead use a randomized time integrator for the Hamiltonian dynamics. 1 The aim of this paper is to suggest one such randomized integration strategy, which involves a very minor modification of the Verlet time integrator, and hence, is easy to implement. The basic idea in this new integrator is to replace the trapezoidal quadrature rule used by Verlet in each stratum with a Monte Carlo quadrature rule.…”
Section: Definition Of the Uhmc Algorithm With Smc Time Integrationmentioning
confidence: 99%
See 1 more Smart Citation