A unified approach for the solution of the Fokker-Planck equation

Physics – Computational Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages

Scientific paper

10.1088/0305-4470/33/27/311

This paper explores the use of a discrete singular convolution algorithm as a unified approach for numerical integration of the Fokker-Planck equation. The unified features of the discrete singular convolution algorithm are discussed. It is demonstrated that different implementations of the present algorithm, such as global, local, Galerkin, collocation, and finite difference, can be deduced from a single starting point. Three benchmark stochastic systems, the repulsive Wong process, the Black-Scholes equation and a genuine nonlinear model, are employed to illustrate the robustness and to test accuracy of the present approach for the solution of the Fokker-Planck equation via a time-dependent method. An additional example, the incompressible Euler equation, is used to further validate the present approach for more difficult problems. Numerical results indicate that the present unified approach is robust and accurate for solving the Fokker-Planck equation.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A unified approach for the solution of the Fokker-Planck equation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A unified approach for the solution of the Fokker-Planck equation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A unified approach for the solution of the Fokker-Planck equation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-398473

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.