Fast Greeks by simulation: The block adjoint method with memory reduction

被引:1
|
作者
Hu, Wenbin [1 ]
Li, Shenghong [1 ]
机构
[1] Zhejiang Univ, Dept Math, Hangzhou 310027, Zhejiang, Peoples R China
基金
中国国家自然科学基金;
关键词
Monte Carlo; Block simulation; Sensitivity; Adjoint; Memory reduction; AMERICAN-STYLE OPTIONS;
D O I
10.1016/j.cam.2014.07.005
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The pathwise method is one of the approaches to calculate the option price sensitivities by Monte Carlo simulation. Under the general diffusion process, we usually use the Euler scheme to simulate the path of the underlying asset, which requires small time spaces to assure the convergence. The adjoint method can be used to accelerate the calculation of the Greeks in such case. However, it needs to store the intermediate information along the path. In this paper, we propose to use the block simulation to further accelerate the calculation. Block simulation can be seen as an extension of the common Monte Carlo simulation. It is simple to implement, without any extra work and loss in accuracy. It also has the flexibility on the block division, fitting to the computation environment. Moreover, we use the extended forward-path method along with the real time calculation strategy to do the memory reduction so that it can be combined with the adjoint method better. The numerical tests show our method can accelerate the adjoint method by several times. Our method is relatively even more efficient in the high-dimensional case. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:70 / 78
页数:9
相关论文
共 50 条
  • [1] Differentiable Cosmological Simulation with the Adjoint Method
    Li, Yin
    Modi, Chirag
    Jamieson, Drew
    Zhang, Yucheng
    Lu, Libin
    Feng, Yu
    Lanusse, Francois
    Greengard, Leslie
    ASTROPHYSICAL JOURNAL SUPPLEMENT SERIES, 2024, 270 (02):
  • [2] DIFFERENTIAL FAULT SIMULATION - A FAST METHOD USING MINIMAL MEMORY
    CHENG, WT
    YU, ML
    26TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, 1989, : 424 - 428
  • [3] Inspection of the Contact Block Reduction Method for Quantum Transport Simulation of FinFETs
    Sabry, Yasser M.
    Attaby, Amr A.
    Abdolkader, Tarek M.
    Farouk, Wael Fikry
    NRSC: 2009 NATIONAL RADIO SCIENCE CONFERENCE: NRSC 2009, VOLS 1 AND 2, 2009, : 762 - 769
  • [4] Adaptive simulation, the adjoint state method, and optimization
    Gockenbach, MS
    Symes, WW
    LARGE-SCALE PDE-CONSTRAINED OPTIMIZATION, 2003, 30 : 281 - 297
  • [5] Block Shuffle: A Method for High-Resolution Fast Style Transfer With Limited Memory
    Ma, Weifeng
    Chen, Zhe
    Ji, Caoting
    IEEE ACCESS, 2020, 8 : 158056 - 158066
  • [6] Shared-memory block-based fast marching method for hierarchical meshes
    Quell, Michael
    Diamantopoulos, Georgios
    Hoessinger, Andreas
    Weinbub, Josef
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2021, 392
  • [7] Likelihood Ratio Method and Algorithmic Differentiation: Fast Second Order Greeks
    Capriotti, Luca
    ALGORITHMIC FINANCE, 2015, 4 (1-2) : 81 - 87
  • [8] Block Latency Insertion Method (Block-LIM) for Fast Transient Simulation of Tightly Coupled Transmission Lines
    Sekine, Tadatoshi
    Asai, Hideki
    EMC 2009: IEEE INTERNATIONAL SYMPOSIUM ON ELECTROMAGNETIC COMPATIBILITY, TECHNICAL PAPER, 2009, : 253 - 257
  • [9] The adjoint method coupled with the modal identification method for nonlinear model reduction
    Favennec, Y
    Giraultz, M
    Petit, D
    INVERSE PROBLEMS IN SCIENCE AND ENGINEERING, 2006, 14 (02) : 153 - 170
  • [10] Simulation model size reduction using volume of investigation by fast marching method
    Teng, Bailu
    JOURNAL OF PETROLEUM SCIENCE AND ENGINEERING, 2020, 191