Consistency and convergence for a family of finite volume discretizations of the Fokker–Planck operator

02/21/2020 ∙ by Martin Heida, et al. ∙ 0

We introduce a family of various finite volume discretization schemes for the Fokker–Planck operator, which are characterized by different weight functions on the edges. This family particularly includes the well-established Scharfetter–Gummel discretization as well as the recently developed square-root approximation (SQRA) scheme. We motivate this family of discretizations both from the numerical and the modeling point of view and provide a uniform consistency and error analysis. Our main results state that the convergence order primarily depends on the quality of the mesh and in second place on the quality of the weights. We show by numerical experiments that for small gradients the choice of the optimal representative of the discretization family is highly non-trivial while for large gradients the Scharfetter–Gummel scheme stands out compared to the others.



There are no comments yet.


page 24

page 25

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.