Refine
Year of publication
Document Type
- Article (35)
- ZIB-Report (12)
- Book chapter (2)
Is part of the Bibliography
- no (49)
Keywords
Two different approaches to parameter estimation (PE) in the context of polymerization are introduced, refined, combined, and applied. The first is classical PE where one is interested in finding parameters which minimize the distance between the output of a chemical model and experimental data. The second is Bayesian PE allowing for quantifying parameter uncertainty caused by experimental measurement error and model imperfection. Based on detailed descriptions of motivation, theoretical background, and methodological aspects for both approaches, their relation are outlined. The main aim of this article is to show how the two approaches complement each other and can be used together to generate strong information gain regarding the model and its parameters. Both approaches and their interplay in application to polymerization reaction systems are illustrated. This is the first part in a two-article series on parameter estimation for polymer reaction kinetics with a focus on theory and methodology while in the second part a more complex example will be considered.
The reactivity ratios of acrylic acid (AA, M1) and its dimer beta-acroyloxypropionic acid (diAA, M2) are determined from cumulative copolymerization data by two different methods: classical parameter estimation (PE) by minimizing the objective function and a Bayesian analysis. Classical PE gives r1 =0.74 and r2 = 1.23 at the minimum of the residual. From the Bayesian analysis, the probability distribution of the parameter sets is obtained, revealing the existence of parameter sets with rather the same probability. The influence of the number of data and the size of the measurement error are discussed.
\begin{abstract} In systems biology, the stochastic description of biochemical reaction kinetics is increasingly being employed to model gene regulatory networks and signalling pathways. Mathematically speaking, such models require the numerical solution of the underlying evolution equat ion, also known as the chemical master equation (CME). Up to now, the CME has almost exclusively been treated by Monte-Carlo techniques, the most prominent of which is the simulation algorithm suggest ed by Gillespie in 1976. Since this algorithm requires an update for each single reaction event, realizations can be computationally very costly. As an alternative, we here propose a novel approach, which focuses on the discrete partial differential equation (PDE) structure of the CME and thus allows to adopt ideas from adaptive discrete Galerkin methods (as designed by two of the present authors in 1989), which have proven to be highly efficient in the mathematical modelling of polyreaction kinetics. Among the two different options of discretizing the CME as a discrete PDE, the method of lines approach (first space, then time) and the Rothe method (first time, then space), we select the latter one for clear theoretical and algorithmic reasons. First numeric al experiments at a challenging model problem illustrate the promising features of the proposed method and, at the same time, indicate lines of necessary further research. \end{abstract}
This paper presents the new program package MACRON for the simulation of macromolecular kinetics including standard chemical reactions. Such problems lead to countable (possibly) infinite systems of ordinary differential equations (CODE's), which are numerically treated by the so-called discrete Galerkin method here. By a chemical compiler the required analytical preprocessing is performed, such that the complete reaction system, standard kinetics as well as macromolecular reactions, can be entered in the chemical formalism. Typical macromolecular reaction steps are chain addition, termination, chain transfer and degradation (cracking). In order to ensure efficiency and reliability, high sophisticated numerical routines are built within the package. MACRON can be used without a detailed knowledge of the used numerical methods. As an illustration the application of MACRON to some realistic problems is presented.
The mathematical modeling of macromolecular reactions leads to countable (possibly infinite) systems of ordinary differential equations (CODE's). This paper reviews two recent developments of the so-called discrete Galerkin method, which has been developed for the numerical treatment of countable systems, which arise e.g. in polymer chemistry. The first approach can be considered as a method of lines with moving basis functions and has been implemented recently in the program package MACRON. The second type of the Galerkin method is characterized by a so-called outer time discretization of the complete problem and an appropriate and efficient solution of the arising subproblems. This method is realized in the research code CODEX.
Countable systems of ordinary differential equations appear frequently in chemistry, physics, biology and medicine. They can be considered as ordinary differential equations in sequence spaces. In this work, a full adaptive algorithm for the computational treatment of such systems is developed. The method combines time discretization with extrapolation in Hilbert spaces with a discrete Galerkin approach as discretization of the stationary subproblems. The Galerkin method is based on orthogonal functions of a discrete variable , which are generated by certain weight functions. A theory of countable systems in the associated weighted sequence spaces is developed as well as a theory of the Galerkin method. The Galerkin equations can be assembled either by use of analytical properties of the orthogonal functions or numerically by a multilevel summation algorithm. The resulting algorithm CODEX is applied to many examples of technological interest, in particular from polymer chemistry.
Countable systems of ordinary differential equations appear frequently in chemistry, physics, biology and statistics. They can be considered as ordinary differential equations in sequence spaces. In this work, a fully adaptive algorithm for the computational treatment of such systems is developed. The method is based on a time discretization of an abstract Cauchy problem in Hilbert space and a discrete Galerkin approach for the discretization of the arising stationary subproblems. The Galerkin method uses orthogonal functions of a discrete variable, which are generated by certain weight functions. A theory of countable systems in the associated weighted sequence spaces is developed as well as a theory of the Galerkin method. The Galerkin equations are solved adaptively either by use of analytical properties of the orthogonal functions or by an appropriate numerical summation. The resulting algorithm CODEX is applied to examples of technological interest, in particular from polymer chemistry.
The description of chain length distributions in macromolecular reaction kinetics leads to so-called countable systems of differential equations. In particular, when the appearing reaction rate coefficients depend on the chain length of the reacting macromolecules itself, an efficient numerical treatment of these systems is very difficult. Then even the evaluation of the right-hand side of the system can become prohibitively expensive with respect to computing time. In this paper we show how the discrete Galerkin method can be applied to such problems. The existing algorithm CODEX is improved by use of a multiplicative error correction scheme for time discretization and a new type of numerical preprocessing by means of a Gauss summation. Both ideas are exemplary for a wide class of approximation types and are described very briefly here. The new numerical techniques are tested on an example from soot formation, where the coagulation of molecules is modeled in terms of reaction coefficients depending on the surface of the particles and their collision frequency.
Computational Treatment of Polyreaction Kinetics by Orthogonal Polynomials of a Discrete Variable.
(1988)
The paper presents a new approach to the computational treatment of polyreaction kinetics. This approach is characterized by a Galerkin method based on orthogonal polynomials of a discrete variable, the polymer degree (or chain length). In comparison with the known competing approaches (statistical moment treatment, Galerkin methods for continuous polymer models), the suggested method is shown to avoid the disadvantages and preserve the adventages of either of them. The basic idea of the method is the construction of a discrete inner product associated with a reasonably chosen probability density function. For the so-called Schulz-Flory distribution one thus obtains the discrete Laguerre polynomials, whereas the Poisson distribution leads to the Charlier polynomials. Numerical experiments for selected polyreaction mechanisms illustrate the efficiency of the proposed method.
Models for occupation dynamics in discrete quantum systems lead to large or even infinite systems of ordinary differential equations. Some new mathematical techniques, developed for the simulation of chemical processes, make a numerical solution of countable systems of ordinary differential equations possible. Both, a basic physical concept for the construction of such systems and the structure of the numerical tools for solving them are presented. These conceptual aspects are illustrated by a simulation of an occupation process from spectroscopy. In this example the structures of rotation spectra observed in infrared spectroscopy are explained and some possibilities for an extension of the model are shown.