IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v293y2017icp334-344.html
   My bibliography  Save this article

Implementation of variable parameters in the Krylov-based finite state projection for solving the chemical master equation

Author

Listed:
  • Vo, H.D.
  • Sidje, R.B.

Abstract

The finite state projection (FSP) algorithm is a reduction method for solving the chemical master equation (CME). The Krylov-FSP improved on the original FSP by using an embedded scheme where the action of the matrix exponential is evaluated by the Krylov subspace method of Expokit for greater efficiency. There are parameters that impact the method, such as the stepsize that must be controlled to ensure the accuracy of the computed matrix exponentials, or to ensure the accuracy of the FSP. Other parameters include the dimension of the Krylov basis, or even the extent of reachability when expanding the FSP. In this work, we incorporate adaptive strategies to automatically vary these parameters. Numerical experiments comparing the resulting variants are reported, showing how certain choices perform better than others.

Suggested Citation

  • Vo, H.D. & Sidje, R.B., 2017. "Implementation of variable parameters in the Krylov-based finite state projection for solving the chemical master equation," Applied Mathematics and Computation, Elsevier, vol. 293(C), pages 334-344.
    • Handle: RePEc:eee:apmaco:v:293:y:2017:i:c:p:334-344
    DOI: 10.1016/j.amc.2016.08.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316305082
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.08.013?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sidje, Roger B. & Stewart, William J., 1999. "A numerical study of large sparse matrix exponentials arising in Markov chains," Computational Statistics & Data Analysis, Elsevier, vol. 29(3), pages 345-368, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Yong & Gu, Chuanqing, 2019. "A shift and invert reorthogonalization Arnoldi algorithm for solving the chemical master equation," Applied Mathematics and Computation, Elsevier, vol. 349(C), pages 1-13.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mercier, Sophie, 2008. "Bounds and approximations for continuous-time Markovian transition probabilities and large systems," European Journal of Operational Research, Elsevier, vol. 185(1), pages 216-234, February.
    2. Alexander Herbertsson, 2011. "Modelling default contagion using multivariate phase-type distributions," Review of Derivatives Research, Springer, vol. 14(1), pages 1-36, April.
    3. Igor Halperin & Andrey Itkin, 2013. "USLV: Unspanned Stochastic Local Volatility Model," Papers 1301.4442, arXiv.org, revised Mar 2013.
    4. Garrett Jenkinson & John Goutsias, 2012. "Numerical Integration of the Master Equation in Some Models of Stochastic Epidemiology," PLOS ONE, Public Library of Science, vol. 7(5), pages 1-9, May.
    5. Herbertsson, Alexander, 2007. "Modelling Default Contagion Using Multivariate Phase-Type Distributions," Working Papers in Economics 271, University of Gothenburg, Department of Economics.
    6. Suñé, Víctor & Carrasco, Juan Antonio, 2017. "Implicit ODE solvers with good local error control for the transient analysis of Markov models," Applied Mathematics and Computation, Elsevier, vol. 293(C), pages 96-111.
    7. Chris Sherlock, 2021. "Direct statistical inference for finite Markov jump processes via the matrix exponential," Computational Statistics, Springer, vol. 36(4), pages 2863-2887, December.
    8. Wu, Xiaoxia & Zhang, Lianzhu, 2019. "On structural properties of ABC-minimal chemical trees," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.
    9. Herbertsson, Alexander & Rootzén, Holger, 2007. "Pricing k-th-to-default Swaps under Default Contagion: The Matrix-Analytic Approach," Working Papers in Economics 269, University of Gothenburg, Department of Economics.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:293:y:2017:i:c:p:334-344. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.