By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Scientific Computing

Previous Article
On Preconditioned Iterative Methods for Burgers Equations
We study the Newton method and a fixed-point method for solving the system of nonlinear equations arising from the Sinc–Galerkin discretization of the Burgers equations. In each step of the New...

You are not logged in to this journal. Log in

Efficient Hierarchical Approximation of High-Dimensional Option Pricing Problems

SIAM J. Sci. Comput. Volume 29, Issue 1, pp. 440-458 (2007)

Published February 26, 2007
Buy This PDF   (US$25)
Download PDF (297 kB) Download Compressed PostScript View Cart

A major challenge in computational finance is the pricing of options that depend on a large number of risk factors. Prominent examples are basket or index options where dozens or even hundreds of stocks constitute the underlying asset and determine the dimensionality of the corresponding degenerate parabolic equation. The objective of this article is to show how an efficient discretization can be achieved by hierarchical approximation as well as asymptotic expansions of the underlying continuous problem. The relation to a number of state-of-the-art methods is highlighted.

©2007 Society for Industrial and Applied Mathematics
History: Received January 11, 2006; accepted September 13, 2006; published February 26, 2007
Permalink: http://dx.doi.org/10.1137/060649616

KEYWORDS and AMS

Keywords
AMS Subject Classifications
65N06, 65N12, 65N15, 65N40

PUBLICATION DATA

ISSN:
1064-8275 (print)   1095-7197 (online)
Publisher:
AIP is a member of CrossRef SIAM

REFERENCES (24)

For access to fully linked references, you need to log in. For access to fully linked references, you need to Log in.

CITING ARTICLES

For access to citing articles, you need to log in.
For access to citing articles, you need to Log in.