Homogeneous Balance Equation for Measures: Errors of the Stochastic Solution (Q4933820)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1388960
Language Label Description Also known as
default for all languages
No label defined
    English
    Homogeneous Balance Equation for Measures: Errors of the Stochastic Solution
    scientific article; zbMATH DE number 1388960

      Statements

      Homogeneous Balance Equation for Measures: Errors of the Stochastic Solution (English)
      0 references
      24 September 2000
      0 references
      Boltzmann-like equations
      0 references
      bias and variance main terms
      0 references
      Nanbu algorithm
      0 references
      contraction semigroups
      0 references
      \(n\)-particle stochastic methods
      0 references
      balance differential equations
      0 references
      \(n\)-particle processes
      0 references
      law-of-large-numbers
      0 references
      The authors investigate \(n\)-particle stochastic methods for general homogeneous balance differential equations \[ {d\mu_t\over dt}= B(\mu_t)- \mu_t,\quad \mu_0= \mu\in H, \] where \(\mu_t\) is a measure-valued function, \(H\) is the set of distributions on a measurable space, and \(B\) is a mapping \(H\mapsto H\). They consider a wide class of \(n\)-particle processes \((\zeta^{(n)}_1(t),\dots, \zeta^{(n)}_n(t))\) for stochastic solution of the balance equations. The law-of-large-numbers \[ \widehat\psi_n(g, t):={1\over n} \sum^n_{i= 1} g(\zeta^{(n)}_i(t))\to \int g d\mu_t:= \psi(\mu_t),\quad n\to\infty, \] is studied. They obtain explicit expressions for the main terms of both bias \(E\widehat\psi_n(g, t)- \psi(\mu_t)\) and mean square deviation \(E(\widehat\psi_n(g, t)- \psi(\mu_t))^2\) of the estimate \(\widehat\psi_n(g, t)\). Boltzmann-like and linear equations are considered as the particular cases of balance equations. Several new and well-known algorithms (among them the Nanbu and Bird-like algorithms) are compared from the statistical and complexity points of view. The technique applied is placed around the Trotter-Kato theorem and the Duhamel perturbation formula for contraction semigroups on Banach spaces.
      0 references
      0 references
      0 references

      Identifiers