Stable computation of probability densities for metastable dynamical systems
Whenever the invariant stationary density of metastable dynamical systems decomposes into almost invariant partial densities, its computation as eigenvector of some transition probability matrix is an ill-conditioned problem. In order to avoid this computational difficulty, we suggest applying an aggregation/disaggregation method which addresses only well-conditioned subproblems aud thus results in a stable algorithm. In contrast to existing methods, the aggregation step is done via a sampling algorithm which covers only small patches of the sampling space. Finally, the theoretical analysis is illustrated by two biomolecular examples.
ZR-06-39.pdf
openaccess
1005.78 KB
Adobe PDF
89e4e026e14718d4bb94ab82cb041c0b
stable_computation_probability_densities.pdf
openaccess
753.93 KB
Adobe PDF
ed11e4fbca79f863086c82bd1bb0834c