A simple and efficient method of simulation is discwsed for point processes that are specified by their conditional intensities. Tbe metbud is based on tbe thinning algorithm which was introduced recently by Lewis and Shedler for the simulation of nonhomogeneous Poisson pmcesses. Algorithms are given for past dependent point processes contain@ multivariate processes. The simulations are perform...

The projection method obtains non-trivial point processes from higher dimensional Poisson point processes by constructing a random subset of the higher dimensional space and projecting the points of the Poisson process lying in that set onto the lower dimensional region. This paper presents a review of this method related to spatial point processes as well as some examples of its applications. ...

Design and maintenance of nuclear cycle facilities mandatory imply implementation of efficient radiation protection. Radiation environment assessment and shielding optimization require a considerable amount of numerical calculations. Nowadays mathematical modelling methods and corresponding software are widely used for such kind of problems. All the software used for radiation fields modelling ...

A model for granular material is presented that describes both the internal deformation of each granule and the interactions between grains. The model, which is based on the FLIP-Material Point, particle-in-cell method, solves continuum constitutive models for each grain. Interactions between grains are calculated with a contact algorithm that forbids interpenetration, but allows separation and...

The Material Point Method (MPM) discrete solution procedure for computational solid mechanics is generalized using a variational form and a Petrov– Galerkin discretization scheme, resulting in a family of methods named the Generalized Interpolation Material Point (GIMP) methods. The generalization permits identification with aspects of other point or node based discrete solution techniques whic...

This paper clarifies the method described in our previous paper (DOI: 978-3-319-02726-5 21), namely rainbow distinguished point method, and give revised theoretical and experimental results which shows rainbow distinguished point method behaves inferiorly to other time memory tradeoff methods.

We examine the linear convergence rates of variants of the proximal point method for finding zeros of maximal monotone operators. We begin by showing how metric subregularity is sufficient for linear convergence to a zero of a maximal monotone operator. This result is then generalized to obtain convergence rates for the problem of finding a common zero of multiple monotone operators by consider...

EÎ'(X, A) = Ê\T, H\X, A)) where H denotes the Tate cohomology ofir [l, Chapter 12 ] and H'(X, A) is the jth Cech cohomology group of (X, A) with arbitrary coefficients and with w action induced by that on X. The term Ew is the graded module associated with a certain filtered module J*(XyA). This sequence is natural with respect to ir-equivariant maps of (X, A). If w acts trivially on X, the seq...

A time-implicit discretization is derived and validated for the material-point method (MPM). The resulting non-linear, discrete equations are solved using Newton’s method combined with either the conjugate gradient method or the generalized minimum residual method. These Newton-Krylov solvers are implemented in a matrix-free fashion for numerical efficiency. A description of the algorithms and ...

A new algorithm is described which extends the material point method (MPM) to allow explicit cracks within the model material. Conventional MPM enforces velocity and displacement continuity through its background grid. This approach is incompatible with cracks which are displacement and velocity discontinuities. By allowing multiple velocity fields at special nodes near cracks, the new method (...