ترغب بنشر مسار تعليمي؟ اضغط هنا

Variance of finite difference methods for reaction networks with non-Lipschitz rate functions

318   0   0.0 ( 0 )
 نشر من قبل David Anderson
 تاريخ النشر 2019
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

Parametric sensitivity analysis is a critical component in the study of mathematical models of physical systems. Due to its simplicity, finite difference methods are used extensively for this analysis in the study of stochastically modeled reaction networks. Different coupling methods have been proposed to build finite difference estimators, with the split coupling, also termed the stacked coupling, yielding the lowest variance in the vast majority of cases. Analytical results related to this coupling are sparse, and include an analysis of the variance of the coupled processes under the assumption of globally Lipschitz intensity functions [Anderson, SIAM Numerical Analysis, Vol. 50, 2012]. Because of the global Lipschitz assumption utilized in [Anderson, SIAM Numerical Analysis, Vol. 50, 2012], the main result there is only applicable to a small percentage of the models found in the literature, and it was conjectured that similar results should hold for a much wider class of models. In this paper we demonstrate this conjecture to be true by proving the variance of the coupled processes scales in the desired manner for a large class of non-Lipschitz models. We further extend the analysis to allow for time dependence in the parameters. In particular, binary systems with or without time-dependent rate parameters, a class of models that accounts for the vast majority of systems considered in the literature, satisfy the assumptions of our theory.



قيم البحث

اقرأ أيضاً

131 - Xiaojie Wang 2020
A novel class of implicit Milstein type methods is devised and analyzed in the present work for stochastic differential equations (SDEs) with non-globally Lipschitz drift and diffusion coefficients. By incorporating a pair of method parameters $theta , eta in [0, 1]$ into both the drift and diffusion parts, the new schemes can be viewed as a kind of double implicit methods, which also work for non-commutative noise driven SDEs. Within a general framework, we offer upper mean-square error bounds for the proposed schemes, based on certain error terms only getting involved with the exact solution processes. Such error bounds help us to easily analyze mean-square convergence rates of the schemes, without relying on a priori high-order moment estimates of numerical approximations. Putting further globally polynomial growth condition, we successfully recover the expected mean-square convergence rate of order one for the considered schemes with $theta in [tfrac12, 1]$, solving general SDEs in various circumstances. As applications, some of the proposed schemes are also applied to solve two scalar SDE models arising in mathematical finance and evolving in the positive domain $(0, infty)$. More specifically, the particular drift-diffusion implicit Milstein method ($ theta = eta = 1 $) is utilized to approximate the Heston $tfrac32$-volatility model and the semi-implicit Milstein method ($theta =1, eta = 0$) is used to solve the Ait-Sahalia interest rate model. With the aid of the previously obtained error bounds, we reveal a mean-square convergence rate of order one of the positivity preserving schemes for the first time under more relaxed conditions, compared with existing relevant results for first order schemes in the literature. Numerical examples are finally reported to confirm the previous findings.
We introduce a hybrid method to couple continuous Galerkin finite element methods and high-order finite difference methods in a nonconforming multiblock fashion. The aim is to optimize computational efficiency when complex geometries are present. The proposed coupling technique requires minimal changes in the existing schemes while maintaining strict stability, accuracy, and energy conservation. Results are demonstrated on linear and nonlinear scalar conservation laws in two spatial dimensions.
We present a hybridization technique for summation-by-parts finite difference methods with weak enforcement of interface and boundary conditions for second order, linear elliptic partial differential equations. The method is based on techniques from the hybridized discontinuous Galerkin literature where local and global problems are defined for the volume and trace grid points, respectively. By using a Schur complement technique the volume points can be eliminated, which drastically reduces the system size. We derive both the local and global problems, and show that the linear systems that must be solved are symmetric positive definite. The theoretical stability results are confirmed with numerical experiments as is the accuracy of the method.
Reaction networks are often used to model interacting species in fields such as biochemistry and ecology. When the counts of the species are sufficiently large, the dynamics of their concentrations are typically modeled via a system of differential e quations. However, when the counts of some species are small, the dynamics of the counts are typically modeled stochastically via a discrete state, continuous time Markov chain. A key quantity of interest for such models is the probability mass function of the process at some fixed time. Since paths of such models are relatively straightforward to simulate, we can estimate the probabilities by constructing an empirical distribution. However, the support of the distribution is often diffuse across a high-dimensional state space, where the dimension is equal to the number of species. Therefore generating an accurate empirical distribution can come with a large computational cost. We present a new Monte Carlo estimator that fundamentally improves on the classical Monte Carlo estimator described above. It also preserves much of classical Monte Carlos simplicity. The idea is basically one of conditional Monte Carlo. Our conditional Monte Carlo estimator has two parameters, and their choice critically affects the performance of the algorithm. Hence, a key contribution of the present work is that we demonstrate how to approximate optimal values for these parameters in an efficient manner. Moreover, we provide a central limit theorem for our estimator, which leads to approximate confidence intervals for its error.
The stable operation of gas networks is an important optimization target. While for this task commonly finite volume methods are used, we introduce a new finite difference approach. With a summation by part formulation for the spatial discretization, we get well-defined fluxes between the pipes. This allows a simple and explicit formulation of the coupling conditions at the node. From that, we derive the adjoint equations for the network simply and transparently. The resulting direct and adjoint equations are numerically efficient and easy to implement. The approach is demonstrated by the optimization of two sample gas networks.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا