Marknadens största urval
Fri frakt över 199 kr
Snabb leverans
Hjälp
Logga in
  1. Hem
  2. Böcker
  3. Företagande & lärande
  4. Data & IT
  5. Asymptotic Methods for the Fokker-Planck Equation and the Exit Problem in Applications

Asymptotic Methods for the Fokker-Planck Equation and the Exit Problem in Applications

av Johan Grasman

del av Springer Series in Synergetics-serien

Asymptotic Methods for the Fokker-Planck Equation and the Exit Problem in Applications av Johan Grasman
Om Asymptotic Methods for the Fokker-Planck Equation and the Exit Problem in Applications

Asymptotic methods are of great importance for practical applications, especially in dealing with boundary value problems for small stochastic perturbations. The most likely exit point and expected escape time are determined with singular perturbation methods for the corresponding Fokker-Planck equation.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9783642084096
  • Format:
  • Häftad
  • Sidor:
  • 220
  • Utgiven:
  • 9. december 2010
  • Utgåva:
  • 11999
  • Mått:
  • 156x236x14 mm.
  • Vikt:
  • 350 g.
  Fri leverans
Leveranstid: 2-4 veckor
Förväntad leverans: 27. november 2024

Om Johan Grasman

Se alla böcker av Johan Grasman

Beskrivning av Asymptotic Methods for the Fokker-Planck Equation and the Exit Problem in Applications

Asymptotic methods are of great importance for practical applications, especially in dealing with boundary value problems for small stochastic perturbations. The most likely exit point and expected escape time are determined with singular perturbation methods for the corresponding Fokker-Planck equation.

Användarnas betyg av Asymptotic Methods for the Fokker-Planck Equation and the Exit Problem in Applications



Andra köpte även...
Hitta liknande böcker
Boken Asymptotic Methods for the Fokker-Planck Equation and the Exit Problem in Applications finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.