Direct computation for American put option and free boundary using finite difference method

Beom Jin Kim, Cheonghee Ahn, Hi Jun Choe

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

We present a direct computation scheme for pricing American put option using finite difference method (FDM) characterized by the node moving and the fixed node scale in continuation region. The work is motivated by the necessity for better understanding of the solution surface near free boundary (early exercise boundary). We exploit an intermediate function which has Lipschitz character near free boundary. The intermediate function produces a linearly converging algorithm to locate the free boundary which appears as the real root of a cubic polynomial. In conclusion, our method shows good performance in accuracy and convergence speed.

Original languageEnglish
Pages (from-to)21-37
Number of pages17
JournalJapan Journal of Industrial and Applied Mathematics
Volume30
Issue number1
DOIs
Publication statusPublished - 2013 Feb 1

Fingerprint

Free Boundary
Finite difference method
Difference Method
Finite Difference
Roots of a cubic
Real Roots
Convergence Speed
Polynomials
Vertex of a graph
Exercise
Continuation
Pricing
Lipschitz
Linearly
Costs
Polynomial

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Applied Mathematics

Cite this

@article{841c3c1bb4844a02a52249cac518e628,
title = "Direct computation for American put option and free boundary using finite difference method",
abstract = "We present a direct computation scheme for pricing American put option using finite difference method (FDM) characterized by the node moving and the fixed node scale in continuation region. The work is motivated by the necessity for better understanding of the solution surface near free boundary (early exercise boundary). We exploit an intermediate function which has Lipschitz character near free boundary. The intermediate function produces a linearly converging algorithm to locate the free boundary which appears as the real root of a cubic polynomial. In conclusion, our method shows good performance in accuracy and convergence speed.",
author = "Kim, {Beom Jin} and Cheonghee Ahn and Choe, {Hi Jun}",
year = "2013",
month = "2",
day = "1",
doi = "10.1007/s13160-012-0094-9",
language = "English",
volume = "30",
pages = "21--37",
journal = "Japan Journal of Industrial and Applied Mathematics",
issn = "0916-7005",
publisher = "Springer Japan",
number = "1",

}

Direct computation for American put option and free boundary using finite difference method. / Kim, Beom Jin; Ahn, Cheonghee; Choe, Hi Jun.

In: Japan Journal of Industrial and Applied Mathematics, Vol. 30, No. 1, 01.02.2013, p. 21-37.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Direct computation for American put option and free boundary using finite difference method

AU - Kim, Beom Jin

AU - Ahn, Cheonghee

AU - Choe, Hi Jun

PY - 2013/2/1

Y1 - 2013/2/1

N2 - We present a direct computation scheme for pricing American put option using finite difference method (FDM) characterized by the node moving and the fixed node scale in continuation region. The work is motivated by the necessity for better understanding of the solution surface near free boundary (early exercise boundary). We exploit an intermediate function which has Lipschitz character near free boundary. The intermediate function produces a linearly converging algorithm to locate the free boundary which appears as the real root of a cubic polynomial. In conclusion, our method shows good performance in accuracy and convergence speed.

AB - We present a direct computation scheme for pricing American put option using finite difference method (FDM) characterized by the node moving and the fixed node scale in continuation region. The work is motivated by the necessity for better understanding of the solution surface near free boundary (early exercise boundary). We exploit an intermediate function which has Lipschitz character near free boundary. The intermediate function produces a linearly converging algorithm to locate the free boundary which appears as the real root of a cubic polynomial. In conclusion, our method shows good performance in accuracy and convergence speed.

UR - http://www.scopus.com/inward/record.url?scp=84874300771&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84874300771&partnerID=8YFLogxK

U2 - 10.1007/s13160-012-0094-9

DO - 10.1007/s13160-012-0094-9

M3 - Article

VL - 30

SP - 21

EP - 37

JO - Japan Journal of Industrial and Applied Mathematics

JF - Japan Journal of Industrial and Applied Mathematics

SN - 0916-7005

IS - 1

ER -