Band 24, Heft 2

Exact representations for the probability density of the life time and survival probability for a sphere and a disc are derived for a general drift-diffusion-reaction process. Based on these new formulas, we suggest an extremely efficient stochastic simulation algorithm for solving transient cathodoluminescence (CL) problems without any mesh in space and time. The method can be applied to a broad class of drift-diffusion-reaction problems where the time behavior of the absorbed material is of interest. The important advantage of the method suggested is the ability to incorporate local inclusions like dislocations, point defects and other singular folds and complicated structures. General Robin boundary conditions on the boundary are treated in a probabilistic way. The method is tested against exact solutions for a series of examples with bounded and unbounded domains. An application to the dislocation imaging problem, which includes thousand threading dislocations, is given.

The ziggurat method is a fast random variable generation method introduced by Marsaglia and Tsang in a series of papers. We discuss how the ziggurat method can be implemented for low-discrepancy sequences, and present algorithms and numerical results when the method is used to generate samples from the normal and gamma distributions.

The sum of log-normal variates is encountered in many challenging applications such as performance analysis of wireless communication systems and financial engineering. Several approximation methods have been reported in the literature. However, these methods are not accurate in the tail regions. These regions are of primordial interest as small probability values have to be evaluated with high precision. Variance reduction techniques are known to yield accurate, yet efficient, estimates of small probability values. Most of the existing approaches have focused on estimating the right-tail of the sum of log-normal random variables (RVs). Here, we instead consider the left-tail of the sum of correlated log-normal variates with Gaussian copula, under a mild assumption on the covariance matrix. We propose an estimator combining an existing mean-shifting importance sampling approach with a control variate technique. This estimator has an asymptotically vanishing relative error, which represents a major finding in the context of the left-tail simulation of the sum of log-normal RVs. Finally, we perform simulations to evaluate the performances of the proposed estimator in comparison with existing ones.

Ordinary differential equations (ODEs) are popularly used to model complex dynamic systems by scientists; however, the parameters in ODE models are often unknown and have to be inferred from noisy measurements of the dynamic system. One conventional method is to maximize the likelihood function, but the likelihood function often has many local modes due to the complexity of ODEs, which makes the optimizing algorithm be vulnerable to trap in local modes. In this paper, we solve the global optimization issue of ODE parameters with the help of the Stochastic Approximation Monte Carlo (SAMC) algorithm which is shown to be self-adjusted and escape efficiently from the “local-trapping” problem. Our simulation studies indicate that the SAMC method is a powerful tool to estimate ODE parameters globally. The efficiency of SAMC method is demonstrated by estimating a predator-prey ODEs model from real experimental data.

The paper is devoted to the model construction for input stochastic processes of a time-invariant linear system with a real-valued square-integrable impulse response function. The processes are considered as Gaussian stochastic processes with discrete spectrum. The response on the system is supposed to be an output process. We obtain the conditions under which the constructed model approximates a Gaussian stochastic process with given accuracy and reliability in the Banach space C⁢([0,1]){C([0,1])}, taking into account the response of the system. For this purpose, the methods and properties of square-Gaussian processes are used.

In this paper we discuss estimation of the quasi-Monte Carlo methods error in the case of calculation of high-order integrals. Quasi-random Halton sequences are considered as a special case. Randomization of these sequences by the random shift method turns out to lead to well-known random quadrature formulas with one free node. Some new properties of such formulas are pointed out. The subject is illustrated by a number of numerical examples.

We considered average dimensions of the weighted Monte Carlo algorithm for a particle transport problem with multi-scattering setting and estimated the probability of particles penetration through a layer. The average dimension d^{\hat{d}} of the algorithm turned out to be small so that quasi-Monte Carlo estimates of the probability converge much faster than the Monte Carlo estimates. We justified the reasons to expect that the convergence of quasi-Monte Carlo estimates continue to be faster as the thickness of the layer increases. Here we calculated d^{\hat{d}} without the use of the ANOVA expansion.