{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/30018"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/30018","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Numerical Methods for the Chemical Master Equation","abstract":"The chemical master equation, formulated on the Markov assumption of underlying chemical kinetics, offers an accurate stochastic description of general chemical reaction systems on the mesoscopic scale. The chemical master equation is especially useful when formulating mathematical models of gene regulatory networks and protein-protein interaction networks, where the numbers of molecules of most species are around tens or hundreds. However, solving the master equation directly suffers from the so called \"curse of dimensionality\" issue. This thesis first tries to study the numerical properties of the master equation using existing numerical methods and parallel machines. Next, approximation algorithms, namely the adaptive aggregation method and the radial basis function collocation method, are proposed as new paths to resolve the \"curse of dimensionality\". Several numerical results are presented to illustrate the promises and potential problems of these new algorithms. Comparisons with other numerical methods like Monte Carlo methods are also included. Development and analysis of the linear Shepard algorithm and its variants, all of which could be used for high dimensional scattered data interpolation problems, are also included here, as a candidate to help solve the master equation by building surrogate models in high dimensions.","abstract_html":"The chemical master equation, formulated on the Markov assumption of underlying chemical kinetics, offers an accurate stochastic description of general chemical reaction systems on the mesoscopic scale. The chemical master equation is especially useful when formulating mathematical models of gene regulatory networks and protein-protein interaction networks, where the numbers of molecules of most species are around tens or hundreds. However, solving the master equation directly suffers from the so called "curse of dimensionality" issue. This thesis first tries to study the numerical properties of the master equation using existing numerical methods and parallel machines. Next, approximation algorithms, namely the adaptive aggregation method and the radial basis function collocation method, are proposed as new paths to resolve the "curse of dimensionality". Several numerical results are presented to illustrate the promises and potential problems of these new algorithms. Comparisons with other numerical methods like Monte Carlo methods are also included. Development and analysis of the linear Shepard algorithm and its variants, all of which could be used for high dimensional scattered data interpolation problems, are also included here, as a candidate to help solve the master equation by building surrogate models in high dimensions.","abstract_has_math":false,"creators":["Zhang, Jingwei"],"institution":"Virginia Tech","degree_name":"Ph. D.","degree_level":"doctoral","degree_discipline":"Mathematics","degree_department":"Mathematics","school":null,"contributors":[],"advisors":[],"committee_chairs":["Watson, Layne T."],"committee_members":["Lin, Tao","Ribbens, Calvin J.","Herdman, Terry L.","Beattie, Christopher A."],"year":2009,"date_issued":"2009-12-02","date_published":"2009-12-02","updated_at":"2026-07-22T22:20:07Z","subjects":["Collocation Method","Radial Basis Function","Shepard Algorithm","M-estimation","Uniformization/Randomization Method","Aggregation/Disaggregation","Stochastic Simulation Algorithm","Parallel Computing","Chemical Master Equation"],"languages":[],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-12092009-143340"],"render_values":[{"text":"etd-12092009-143340","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/30018","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["Watson, Layne T."]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Lin, Tao","Ribbens, Calvin J.","Herdman, Terry L.","Beattie, Christopher A."]},{"key":"dc:contributor.department","label":"Department","values":["Mathematics"]},{"key":"dc:creator","label":"Author","values":["Zhang, Jingwei"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T20:20:05Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T20:20:05Z","2010-01-20"]},{"key":"dc:date.issued","label":"Date","values":["2009-12-02"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Collocation Method","Radial Basis Function","Shepard Algorithm","M-estimation","Uniformization/Randomization Method","Aggregation/Disaggregation","Stochastic Simulation Algorithm","Parallel Computing","Chemical Master Equation"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-12092009-143340"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/30018"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The chemical master equation, formulated on the Markov assumption of underlying chemical kinetics, offers an accurate stochastic description of general chemical reaction systems on the mesoscopic scale. The chemical master equation is especially useful when formulating mathematical models of gene regulatory networks and protein-protein interaction networks, where the numbers of molecules of most species are around tens or hundreds. However, solving the master equation directly suffers from the so called \"curse of dimensionality\" issue. This thesis first tries to study the numerical properties of the master equation using existing numerical methods and parallel machines. Next, approximation algorithms, namely the adaptive aggregation method and the radial basis function collocation method, are proposed as new paths to resolve the \"curse of dimensionality\". Several numerical results are presented to illustrate the promises and potential problems of these new algorithms. Comparisons with other numerical methods like Monte Carlo methods are also included. Development and analysis of the linear Shepard algorithm and its variants, all of which could be used for high dimensional scattered data interpolation problems, are also included here, as a candidate to help solve the master equation by building surrogate models in high dimensions."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph. D."]},{"key":"dc:title","label":"Title","values":["Numerical Methods for the Chemical Master Equation"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Watson, Layne T."],"dc:contributor.committeemember":["Lin, Tao","Ribbens, Calvin J.","Herdman, Terry L.","Beattie, Christopher A."],"dc:contributor.department":["Mathematics"],"dc:creator":["Zhang, Jingwei"],"dc:date.accessioned":["2014-03-14T20:20:05Z"],"dc:date.available":["2014-03-14T20:20:05Z","2010-01-20"],"dc:date.issued":["2009-12-02"],"dc:description.abstract":["The chemical master equation, formulated on the Markov assumption of underlying chemical kinetics, offers an accurate stochastic description of general chemical reaction systems on the mesoscopic scale. The chemical master equation is especially useful when formulating mathematical models of gene regulatory networks and protein-protein interaction networks, where the numbers of molecules of most species are around tens or hundreds. However, solving the master equation directly suffers from the so called \"curse of dimensionality\" issue. This thesis first tries to study the numerical properties of the master equation using existing numerical methods and parallel machines. Next, approximation algorithms, namely the adaptive aggregation method and the radial basis function collocation method, are proposed as new paths to resolve the \"curse of dimensionality\". Several numerical results are presented to illustrate the promises and potential problems of these new algorithms. Comparisons with other numerical methods like Monte Carlo methods are also included. Development and analysis of the linear Shepard algorithm and its variants, all of which could be used for high dimensional scattered data interpolation problems, are also included here, as a candidate to help solve the master equation by building surrogate models in high dimensions."],"dc:description.degree":["Ph. D."],"dc:identifier.other":["etd-12092009-143340"],"dc:identifier.uri":["http://hdl.handle.net/10919/30018"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["Collocation Method","Radial Basis Function","Shepard Algorithm","M-estimation","Uniformization/Randomization Method","Aggregation/Disaggregation","Stochastic Simulation Algorithm","Parallel Computing","Chemical Master Equation"],"dc:title":["Numerical Methods for the Chemical Master Equation"],"dc:type":["Dissertation"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["doctoral"],"thesis:degree_name":["Ph. D."],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:20:07Z"}