Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Nuclear Science and Engineering, 2013. / "June 2013." Cataloged from PDF version of thesis. / Includes bibliographical references (page 14). / A Monte Carlo algorithm for solving simple linear systems using a random walk is demonstrated and analyzed. The described algorithm solves for each element in the solution vector independently. Furthermore, it is demonstrated that this algorithm is easily parallelized. To reduce error, each processor can compute data for an independent element of the solution, or part of the data for a given element for the solution, allowing for larger samples to decrease stochastic error. In addition to parallelization, it is also shown that a probabilistic chain termination can decrease the runtime of the algorithm while maintaining accuracy. Thirdly, a tighter lower bound for the required number of chains given a desired error is determined. / by Cyrus Vafadari. / S.B.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/82451 |
| Date | January 2013 |
| Creators | Vafadari, Cyrus |
| Contributors | Benoit Forget., Massachusetts Institute of Technology. Department of Nuclear Science and Engineering., Massachusetts Institute of Technology. Department of Nuclear Science and Engineering. |
| Publisher | Massachusetts Institute of Technology |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | 27 pages, application/pdf |
| Rights | M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission., http://dspace.mit.edu/handle/1721.1/7582 |
Page generated in 0.0073 seconds