• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Operator splitting methods for pricing American options with stochastic volatility (2004)

Cached

  • Download as a PDF

Download Links

  • [www.mit.jyu.fi]
  • [www.mit.jyu.fi]
  • [users.jyu.fi]
  • [users.jyu.fi]
  • [www.mit.jyu.fi]
  • [www.mit.jyu.fi]
  • [users.jyu.fi]
  • [users.jyu.fi]
  • [www.mit.jyu.fi]
  • [www.mit.jyu.fi]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Samuli Ikonen , Jari Toivanen
Citations:11 - 2 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Ikonen04operatorsplitting,
    author = {Samuli Ikonen and Jari Toivanen},
    title = {Operator splitting methods for pricing American options with stochastic volatility},
    institution = {},
    year = {2004}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Summary. Pricing American options using partial (integro-)differential equation based methods leads to linear complementarity problems (LCPs). The numerical solution of these problems resulting from the Black-Scholes model, Kou’s jumpdiffusion model, and Heston’s stochastic volatility model are considered. The finite difference discretization is described. The solutions of the discrete LCPs are approximated using an operator splitting method which separates the linear problem and the early exercise constraint to separate fractional steps. The numerical experiments demonstrate that the price of options can be computed in a few milliseconds on a PC. 1

Keyphrases

american option    stochastic volatility    linear problem    numerical solution    differential equation    numerical experiment    fractional step    operator splitting method    stochastic volatility model    jumpdiffusion model    finite difference discretization    black-scholes model    early exercise constraint    discrete lcps    complementarity problem   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University