Skip navigation

DSpace JSPUI

DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets

Learn More
DSpace logo
English
中文
  • Browse
    • Communities
      & Collections
    • Publication Year
    • Author
    • Title
    • Subject
    • Advisor
  • Search TDR
  • Rights Q&A
    • My Page
    • Receive email
      updates
    • Edit Profile
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 資訊工程學系
Please use this identifier to cite or link to this item: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/38634
Title: 利用適應性有限體積法評價歐式形態的亞式選擇權
Adaptive Finite Volume Methods for pricing European-Style Asian Options
Authors: Chung-Yu Hsu
徐中昱
Advisor: 呂育道
Keyword: 亞式選擇權,有限體積法,有限差分法,
Asian option,finite volume method,finite difference method,
Publication Year : 2005
Degree: 碩士
Abstract: 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
Fulltext Rights: 有償授權
Appears in Collections:資訊工程學系

Files in This Item:
File SizeFormat 
ntu-94-1.pdf
  Restricted Access
1.68 MBAdobe PDF
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

社群連結
聯絡資訊
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