Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 資訊工程學系
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/38634
標題: 利用適應性有限體積法評價歐式形態的亞式選擇權
Adaptive Finite Volume Methods for pricing European-Style Asian Options
作者: Chung-Yu Hsu
徐中昱
指導教授: 呂育道
關鍵字: 亞式選擇權,有限體積法,有限差分法,
Asian option,finite volume method,finite difference method,
出版年 : 2005
學位: 碩士
摘要: Numerical methods for pricing Asian options have been researched extensively. The common methods can be classified into three types: lattice methods, PDE methods, and Monte Carlo simulation. The ordinary lattice method needs a large amount of computer memory to keep track of the states on the tree; it is time- and space-consuming. Monte Carlo simulation is straightforward to implement, but its convergence speed is very slow. The most familiar PDE method is the finite difference method. The drawback
of traditional finite difference methods is that the accuracy of results depends critically on the spacing of the domain. To achieve high accuracy, the needed number of grid points can be prohibitive.
The best numerical method for solving one-dimensional PDEs runs in quadratic time. In this paper, we present a PDE method with O(mn) time complexity and O(m) space complexity based on the adaptive finite volume discretization method and error control techniques, where m and n are the numbers of grid points in the spatial and time dimensions, respectively. We first confirm the practicability and accuracy of our methodology for pricing
European calls where closed-form formulas are available. Then we proceed to apply this method to European-style fixed strike Asian options. Our numerical evaluation shows that the number of grid points in the time dimension, n, does not have to be vary large compared to m to get accurate results. Therefore, we only need to increase m for more accurate results. This means the time complexity is basically only linear in m.
In our algorithm, we refine areas with higher error variation while leaving others in a coarse discretization. This saves computational time tremendously without sacrificing accuracy. This algorithm also works well for the case with high volatility or high maturity. According to our experiments on Asian options, accuracy of at least 4 digits of precision can be produced in about one second on a personal computer. We also compare our method with other methods in the pricing of European-style Asian options. The results show that it is indeed superior.
URI: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/38634
全文授權: 有償授權
顯示於系所單位:資訊工程學系

文件中的檔案:
檔案 大小格式 
ntu-94-1.pdf
  未授權公開取用
1.68 MBAdobe PDF
顯示文件完整紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved