scholarly journals GPU-Based Monte Carlo Methods for Solving Linear Algebraic Equations

Author(s):  
Siyan Lai
2015 ◽  
Vol 19 (4) ◽  
pp. 1205-1210
Author(s):  
Yi Tian ◽  
Zai-Zai Yan ◽  
Zhi-Min Hong

A numerical method for solving a class of heat conduction equations with variable coefficients in one dimensional space is demonstrated. This method combines the Crank-Nicolson and Monte Carlo methods. Using Crank-Nicolson method, the governing equations are discretized into a large sparse system of linear algebraic equations, which are solved by Monte Carlo method. To illustrate the usefulness of this technique, we apply it to two problems. Numerical results show the performance of the present work.


2016 ◽  
Vol 20 (3) ◽  
pp. 933-937
Author(s):  
Yi Tian ◽  
Zai-Zai Yan

In this paper, we present a numerical method based on random sampling for a parabolic problem. This method combines use of the Crank-Nicolson method and Monte Carlo method. In the numerical algorithm, we first discretize governing equations by Crank-Nicolson method, and obtain a large sparse system of linear algebraic equations, then use Monte Carlo method to solve the linear algebraic equations. To illustrate the usefulness of this technique, we apply it to some test problems.


Author(s):  
J. H. Halton

ABSTRACTThis paper defines the concept of sequential Monte Carlo and outlines the principal modes of approach which may be expected to yield useful sequential processes. Three workable sequential processes, derived from a non-sequential method of J. von Neumann and S. M. Ulam for solving systems of linear algebraic equations, are described and analysed in detail.


Sign in / Sign up

Export Citation Format

Share Document