Krylov approximation and model reduction methods for solving the chemical master equation

Show simple item record

dc.contributor Hadji, Layachi
dc.contributor Halpern, David
dc.contributor Leier, Andre
dc.contributor Sun, Min
dc.contributor.advisor Sidje, Roger B.
dc.contributor.author Vo, Huy D.
dc.date.accessioned 2017-07-28T14:11:59Z
dc.date.available 2017-07-28T14:11:59Z
dc.date.issued 2017
dc.identifier.other u0015_0000001_0002585
dc.identifier.other Vo_alatus_0004D_13094
dc.identifier.uri http://ir.ua.edu/handle/123456789/3182
dc.description Electronic Thesis or Dissertation
dc.description.abstract Complex interacting networks are prevalent across many fields of science and engineering, ranging from chemical kinetics and pharmacology to social sciences. In biochemistry, such networks arise through the reactions between the cell's components such as DNA and RNA molecules. Since these key biomolecules often appear in low copy numbers, the intrinsic randomness of their interactions becomes significant. This calls for a stochastic framework that treats the chemical populations as a continuous-time, discrete-state Markov process. The time-dependent probability distribution of this process is the solution of the chemical master equation (CME). Despite many potential benefits, the CME is notoriously difficult to solve due to the curse of dimensionality. This dissertation is about numerical methods that seek to alleviate this curse. We introduce three tools for this challenging task. The first tool aims to exploit sparsity in the solution of the CME by only keeping states that have a significant probability mass at each time step. It uses the stochastic simulation algorithm to quickly scout these important states, and advance the integration using Krylov subspace approximation techniques. The second tool applies a grid-based aggregation method that is well expressed in terms of the tensor product. It employs a residual-based error control to automatically adapt the aggregation scheme to the region that requires fine details. The third tool leverages novel results in the tensor train format. It combines the finite state projection, tensor-based linear system solvers, and the inexact uniformization method. Numerical results are conducted to show the efficiency of the proposed methods.
dc.format.extent 179 p.
dc.format.medium electronic
dc.format.mimetype application/pdf
dc.language English
dc.language.iso en_US
dc.publisher University of Alabama Libraries
dc.relation.ispartof The University of Alabama Electronic Theses and Dissertations
dc.relation.ispartof The University of Alabama Libraries Digital Collections
dc.relation.hasversion born digital
dc.rights All rights reserved by the author unless otherwise indicated.
dc.subject.other Mathematics
dc.title Krylov approximation and model reduction methods for solving the chemical master equation
dc.type thesis
dc.type text
etdms.degree.department University of Alabama. Dept. of Mathematics
etdms.degree.discipline Mathematics
etdms.degree.grantor The University of Alabama
etdms.degree.level doctoral
etdms.degree.name Ph.D.


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account