Accelerating the Least-Squares Monte Carlo Methodwith Parallel Computing

碩士 === 國立臺灣大學 === 資訊工程學研究所 === 102 === This thesis accelerates the popular least-squares Monte Carlo method (LSM) in finance with parallel computing. Several processes are created to solve LSM. Each process solves a smaller version of LSM independently before averaging the values calculated by all t...

Full description

Bibliographic Details
Main Authors: Ching-Wen Chen, 陳鏡文
Other Authors: Yuh-Dauh Lyuu
Format: Others
Language:en_US
Published: 2014
Online Access:http://ndltd.ncl.edu.tw/handle/56655360426490392952
id ndltd-TW-102NTU05392029
record_format oai_dc
spelling ndltd-TW-102NTU053920292016-03-09T04:24:05Z http://ndltd.ncl.edu.tw/handle/56655360426490392952 Accelerating the Least-Squares Monte Carlo Methodwith Parallel Computing 使用平行運算加速最小平方蒙地卡羅法 Ching-Wen Chen 陳鏡文 碩士 國立臺灣大學 資訊工程學研究所 102 This thesis accelerates the popular least-squares Monte Carlo method (LSM) in finance with parallel computing. Several processes are created to solve LSM. Each process solves a smaller version of LSM independently before averaging the values calculated by all the processes. This methodology turns LSM into an embarrassingly parallel problem. The program is implemented using Parallel Virtual Machine (PVM) and ALGLIB. This thesis focuses on the pricing of American put options. Our proposed method gives accurate option prices with excellent speedups and achieves a speedup of 55 using 64 processes with 8 machines. The same methodology is expected to yield excellent speedups for LSM when applied to more complex financial derivatives. Yuh-Dauh Lyuu 呂育道 2014 學位論文 ; thesis 32 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 國立臺灣大學 === 資訊工程學研究所 === 102 === This thesis accelerates the popular least-squares Monte Carlo method (LSM) in finance with parallel computing. Several processes are created to solve LSM. Each process solves a smaller version of LSM independently before averaging the values calculated by all the processes. This methodology turns LSM into an embarrassingly parallel problem. The program is implemented using Parallel Virtual Machine (PVM) and ALGLIB. This thesis focuses on the pricing of American put options. Our proposed method gives accurate option prices with excellent speedups and achieves a speedup of 55 using 64 processes with 8 machines. The same methodology is expected to yield excellent speedups for LSM when applied to more complex financial derivatives.
author2 Yuh-Dauh Lyuu
author_facet Yuh-Dauh Lyuu
Ching-Wen Chen
陳鏡文
author Ching-Wen Chen
陳鏡文
spellingShingle Ching-Wen Chen
陳鏡文
Accelerating the Least-Squares Monte Carlo Methodwith Parallel Computing
author_sort Ching-Wen Chen
title Accelerating the Least-Squares Monte Carlo Methodwith Parallel Computing
title_short Accelerating the Least-Squares Monte Carlo Methodwith Parallel Computing
title_full Accelerating the Least-Squares Monte Carlo Methodwith Parallel Computing
title_fullStr Accelerating the Least-Squares Monte Carlo Methodwith Parallel Computing
title_full_unstemmed Accelerating the Least-Squares Monte Carlo Methodwith Parallel Computing
title_sort accelerating the least-squares monte carlo methodwith parallel computing
publishDate 2014
url http://ndltd.ncl.edu.tw/handle/56655360426490392952
work_keys_str_mv AT chingwenchen acceleratingtheleastsquaresmontecarlomethodwithparallelcomputing
AT chénjìngwén acceleratingtheleastsquaresmontecarlomethodwithparallelcomputing
AT chingwenchen shǐyòngpíngxíngyùnsuànjiāsùzuìxiǎopíngfāngméngdekǎluófǎ
AT chénjìngwén shǐyòngpíngxíngyùnsuànjiāsùzuìxiǎopíngfāngméngdekǎluófǎ
_version_ 1718200281289719808