Probabilistic Fracture Mechanics Analyses Based on Parallel Monte Carlo Method.
نویسندگان
چکیده
منابع مشابه
Parallel Computing of Polymer Chains Based on Monte Carlo Method
Computer simulation of polymer chain is carried out by Monte Carlo method in this paper. The properties of polymer chain are simulated by self avoiding walk and bond fluctuation model. The parallel computing model is established to solve the physical problems of the polymer chains. We analyze the algorithms for polymer chains to parallel computing at high performance computing center. Gustafson...
متن کاملParallel Monte Carlo Methods
This paper is the key paper in my Survey-based term project. The author argues that Monte Carlo algorithms are ideally suited to parallel computing, and that “parallel Monte Carlo” should be more widely used. Therefore I consider many of issues can be raised by use Parallel Monte Carlo method. And from this paper I also can discuss the possibilities of parallel Markov chain Monte Carlo which is...
متن کاملProbabilistic Path Hamiltonian Monte Carlo
6. Appendix 6.1. Properties of the phylogenetic posterior distribution Assumption 2.3 for the phylogenetic posterior distribution. Recall that L(⌧, q) denotes the likelihood function of the tree T = (⌧, q), we have U(⌧, q) = logL(⌧, q) log ⇡0(⌧, q) Since log ⇡0(⌧, q) is assumed to satisfy the Assumption 2.3, we just need to prove that the phylogenetic likelihood function is smooth while each or...
متن کاملProbabilistic Path Hamiltonian Monte Carlo
Hamiltonian Monte Carlo (HMC) is an efficient and effective means of sampling posterior distributions on Euclidean space, which has been extended to manifolds with boundary. However, some applications require an extension to more general spaces. For example, phylogenetic (evolutionary) trees are defined in terms of both a discrete graph and associated continuous parameters; although one can rep...
متن کاملParallel Monte Carlo Tree Search on GPU
Monte Carlo Tree Search (MCTS) is a method for making optimal decisions in artificial intelligence (AI) problems, typically move planning in combinatorial games. It combines the generality of random simulation with the precision of tree search. It can theoretically be applied to any domain that can be described in terms of state, action pairs and simulation used to forecast outcomes such as dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series A
سال: 1992
ISSN: 0387-5008,1884-8338
DOI: 10.1299/kikaia.58.1798