Volume 30, Issue 3

In this paper, we suggest joint application of computational probabilistic analysis and the Monte Carlo method for numerical stochastic modeling problems. We use all the capabilities of computational probabilistic analysis while maintaining all the advantages of the Monte Carlo method. Our approach allows us to efficiently implement a computational hybrid scheme. In this way, we reduce the computation time and present the results in the form of distributions. The crucial new points of our method are arithmetic operations on probability density functions and procedures for constructing on the probabilistic extensions. Relying on specific numerical examples of solving systems of linear algebraic equations with random coefficients, we present the advantages of our approach.

Conjugate gradient (CG) methods are a popular class of iterative methods for solving linear systems of equations and nonlinear optimization problems. In this paper, a new hybrid conjugate gradient (CG) method is presented and analyzed for solving unconstrained optimization problems, where the parameter β k \beta_{k} is a convex combination of β k WYL \beta_{k}^{\mathrm{WYL}} and β k CD \beta_{k}^{\mathrm{CD}} . Under the strong Wolfe line search, the new method possesses the sufficient descent condition and the global convergence properties. The preliminary numerical results show the efficiency of our method in comparison with other CG methods. Furthermore, the proposed algorithm HWYLCD was extended to solve the problem of a mode function.

Random walk based stochastic simulation methods for solving a nonlinear system of coupled transient diffusion and drift-diffusion equations governing a two-component chemotaxis process are developed. The nonlinear system is solved by linearization, the system is evolved in time, by small time steps, where on each step a linear system of equations is solved by using the solution from the previous time step. Three different stochastic algorithms are suggested, (1) the global random walk on grid (GRWG), (2) a randomized vector algorithm (RVA) based on a special transformation of the original matrix to a stochastic matrix, and (3) a stochastic projection algorithm (SPA). To get high precision results, these methods are combined with an iterative refinement method.

In this article we will propose a novel, self-financing, dynamic and path dependent portfolio trading strategy which is based on the well known principle “sell high – buy low”. Trading strategies are important also for the hedging problem selling/buying an option. The main problem of the writer of an option is how to invest the amount that she has received selling the option therefore the proposed trading strategy play an important role here. We will see that the hedging problem reduces to an optimization one and therefore the portfolio optimization and the hedging problem are closely related. We will also propose a deterministic portfolio selection method (i.e., without making any assumption-guess about the assets) and a notion of a deterministic fair price of an option.

In this paper, we consider a multigroup stochastic SIQR epidemic model with varying total population size. After proving the existence and uniqueness of the global solution to the system, we developed sufficient conditions for the existence of an stationary ergodic distribution of the positive solutions. Then we gave sufficient conditions for extinction of the diseases which is based on the basic reproduction number in its corresponding deterministic system.

This paper analyses a novel two-step Monte Carlo simulation algorithm to estimate the weighted volume of a polytope of the form A ⁢ z ≤ T {Az\leq T} . The essential idea is to partition the columns of A into two categories – a lightweight category and a heavyweight category. Simulation is done in a two-step manner where, for every sample of the lightweight category variables we use multiple samples of the heavyweight category variables. Thus, the heavyweight category variables are oversampled with respect to the lightweight category variables and increasing samples of the heavyweight variables at the expense of the lightweight variables will lead to a more efficient Monte Carlo method. In this paper we present a fast heuristic approximate for estimating the optimal oversampling ratio and substantiate with experimental results which confirm the effectiveness of the method.

We show that the slice sampler generates Markov chains whose variables are mean independent and thus uncorrelated when the target density is centrally symmetric. Skewness instead boosts correlations. Popular implementation algorithms such as stepping-out and multivariate-sampling-with-hyperrectangles add statistical inefficiency, the first in case of multimodality, the second in all circumstances. A new sampler which exploits these structural and algorithmic characteristics to reduce the variance of Monte Carlo estimates is experimented in several sampling problems. An insight into the properties of the product slice sampler is also provided.

In this study we solve the following problem: Simulate random 2D Poisson point processes with a desired correlation function. To solve this problem we suggest the following algorithm: (1) simulate a positive valued random process with the desired correlation function, (2) use this process as an intensity of the doubly stochastic Poisson random point process. We apply this algorithm to simulate random distribution of nanocrystals on a plane. Then we apply the developed methods to calculate excitonic fluxes to the family of generated nanocrystals.