Pith. sign in

REVIEW 1 cited by

Computing stable numerical solutions for multidimensional American option pricing problems: a semi-discretization approach

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1701.08545 v1 pith:QFBPUENP submitted 2017-01-30 q-fin.PR cs.NAmath.APmath.NA

classification q-fin.PRcs.NAmath.APmath.NA
keywords numericalstabilitysolutiontimeproblemsamericanapproachconditions
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The matter of the stability for multi-asset American option pricing problems is a present remaining challenge. In this paper a general transformation of variables allows to remove cross derivative terms reducing the stencil of the proposed numerical scheme and underlying computational cost. Solution of a such problem is constructed by starting with a semi-discretization approach followed by a full discretization using exponential time differencing and matrix quadrature rules. To the best of our knowledge the stability of the numerical solution is treated in this paper for the first time. Analysis of the time variation of the numerical solution with respect to previous time level together with the use of logarithmic norm of matrices are the basis of the stability result. Sufficient stability conditions on step sizes, that also guarantee positivity and boundedness of the solution, are found. Numerical examples for two and three asset problems justify the stability conditions and prove its competitiveness with other relevant methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Solving high-dimensional optimal stopping problems using deep learning

    cs.CE 2019-08 conditional novelty 6.0 of 10

    A single-objective deep learning algorithm for high-dimensional optimal stopping problems computes both approximate optimal exercise strategies and option prices, demonstrated on Bermudan max-call options in up to 500...

Pith tools