Approximate Exponential Algorithms to Solve the Chemical Master Equation
Clicks: 80
ID: 281891
2014
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Popular Article
23.7
/100
80 views
39 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #392 of 803 articles by views in arXiv
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 803 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
This paper discusses new simulation algorithms for stochastic chemical
kinetics that exploit the linearity of the chemical master equation and its
matrix exponential exact solution. These algorithms make use of various
approximations of the matrix exponential to evolve probability densities in
time. A sampling of the approximate solutions of the chemical master equation
is used to derive accelerated stochastic simulation algorithms. Numerical
experiments compare the new methods with the established stochastic simulation
algorithm and the tau-leaping method.
| Reference Key |
sandu2014approximate
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Azam S. Zavar Moosavi; Adrian Sandu |
| Journal | arXiv |
| Year | 2014 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.