請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/17617
標題: | 最小平方蒙地卡羅法之平行化效能評估 Evaluation of Parallelization of the Least-Squares Monte Carlo Method |
作者: | Kuan-Lin Huang 黃冠霖 |
指導教授: | 呂育道(Yuh-Dauh Lyuu) |
關鍵字: | 最小平方蒙地卡羅法,平行化, Least-squares Monte Carlo,parallelization,trinomial Tree, |
出版年 : | 2013 |
學位: | 碩士 |
摘要: | Option pricing is an important issue in financial computing. However, the early-exercise feature of American options makes their pricing more difficult than European options. To price American options using simulation, Longstaff and Schwartz presented a simple yet powerful simulation technique, named the least-squares Monte Carlo method. Least-squares Monte Carlo simulation involves huge amounts of path simulation, which makes it difficult to compute the price in a short amount of time. To solve this problem, this thesis divides the computation paths into threads and then compares the numerical results of the strategy, the original version and the trinomial tree. The outcome shows that the division strategy does not have much impact on the prices. After the numerical evaluation of the division strategy, the least-square Monte Carlo method is parallelized and evaluated on the speedup and efficiency. The results show that the parallelization of the least-squares Monte Carlo method provides considerable speedup without sacrificing numerical accuracy. The Longstaff-Schwartz algorithm is thus amenable to parallelism. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/17617 |
全文授權: | 未授權 |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-102-1.pdf 目前未授權公開取用 | 2.84 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。