Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Computer Science and Information Engineering / 資訊工程學系
  4. An efficient convergent lattice algorithm for european asian options
 
  • Details

An efficient convergent lattice algorithm for european asian options

Resource
Applied Mathematics and Computation 169,1458-1471
Journal
Applied Mathematics and Computation
Journal Volume
169
Journal Issue
2
Pages
1458-1471
Date Issued
2005
Date
2005
Author(s)
Dai, Tian-Shyr
Huang, Guan-Shieng
Lyuu, Yuh-Dauh  
DOI
20060927122848148993
URI
http://www.scopus.com/inward/record.url?eid=2-s2.0-25844467939&partnerID=MN8TOARS
http://scholars.lib.ntu.edu.tw/handle/123456789/318164
http://ntur.lib.ntu.edu.tw/bitstream/246246/20060927122848148993/1/asian.pdf
https://www.scopus.com/inward/record.uri?eid=2-s2.0-25844467939&doi=10.1016%2fj.amc.2004.10.085&partnerID=40&md5=f96ccdadffe3e21ed0bcd232f7c7c089
Abstract
Financial options whose payo ?depends critically on historical prices are called path- dependent options.Their prices are usually harder to calculate than options whose prices do not depend on past histories.Asian options are popular path-dependent derivatives, and it has been a long-standing problem to price them e ?ciently and accurately.No known exact pricing formulas are available to price them under the continuous-time Black –Scholes model.Although approximate pricing formulas exist,they lack accuracy guarantees.Asian options can be priced numerically on the lattice.A lattice divides the time to maturity into n equal-length time steps.The option price computed by the lattice converges to the option value under the Black –Scholes model as n !1 .Unfortunately, only subexponential-time algorithms are available if Asian options are to be priced on the lattice without approximations.E ?cient approximation algorithms are available for the lattice.The fastest lattice algorithm published in the literature runs in O(n 3.5 )-time, whereas for the related PDE method,the fastest one runs in O(n 3 )time.This paper pre- sents a new lattice algorithm that runs in O(n 2.5 )time,the best in the literature for such methods.Our algorithm exploits the method of Lagrange multipliers to minimize the approximation error.Numerical results verify its accuracy and the excellent performance.
Subjects
Option pricing
Lattice
Path-dependent derivative
Asian option
Approximation alg-
orithm
Lagrange multiplier
Other Subjects
Approximation theory; Computational methods; Crystal lattices; Finance; Lagrange multipliers; Mathematical models; Approximation algorithms; Asian option; Lattice; Option pricing; Path-dependent derivatives; Algorithms
Type
journal article
File(s)
Loading...
Thumbnail Image
Name

asian.pdf

Size

186.08 KB

Format

Adobe PDF

Checksum

(MD5):17812559d87afe0790442ef2e0d19013

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science