TY - JOUR

T1 - Multilevel hybrid Chernoff tau-leap

AU - Moraes, Alvaro

AU - Tempone, Raul

AU - Vilanova, Pedro

N1 - KAUST Repository Item: Exported on 2020-10-01

PY - 2015/4/8

Y1 - 2015/4/8

N2 - In this work, we extend the hybrid Chernoff tau-leap method to the multilevel Monte Carlo (MLMC) setting. Inspired by the work of Anderson and Higham on the tau-leap MLMC method with uniform time steps, we develop a novel algorithm that is able to couple two hybrid Chernoff tau-leap paths at different levels. Using dual-weighted residual expansion techniques, we also develop a new way to estimate the variance of the difference of two consecutive levels and the bias. This is crucial because the computational work required to stabilize the coefficient of variation of the sample estimators of both quantities is often unaffordable for the deepest levels of the MLMC hierarchy. Our method bounds the global computational error to be below a prescribed tolerance, TOL, within a given confidence level. This is achieved with nearly optimal computational work. Indeed, the computational complexity of our method is of order O(TOL−2), the same as with an exact method, but with a smaller constant. Our numerical examples show substantial gains with respect to the previous single-level approach and the Stochastic Simulation Algorithm.

AB - In this work, we extend the hybrid Chernoff tau-leap method to the multilevel Monte Carlo (MLMC) setting. Inspired by the work of Anderson and Higham on the tau-leap MLMC method with uniform time steps, we develop a novel algorithm that is able to couple two hybrid Chernoff tau-leap paths at different levels. Using dual-weighted residual expansion techniques, we also develop a new way to estimate the variance of the difference of two consecutive levels and the bias. This is crucial because the computational work required to stabilize the coefficient of variation of the sample estimators of both quantities is often unaffordable for the deepest levels of the MLMC hierarchy. Our method bounds the global computational error to be below a prescribed tolerance, TOL, within a given confidence level. This is achieved with nearly optimal computational work. Indeed, the computational complexity of our method is of order O(TOL−2), the same as with an exact method, but with a smaller constant. Our numerical examples show substantial gains with respect to the previous single-level approach and the Stochastic Simulation Algorithm.

UR - http://hdl.handle.net/10754/557225

UR - http://link.springer.com/10.1007/s10543-015-0556-y

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

U2 - 10.1007/s10543-015-0556-y

DO - 10.1007/s10543-015-0556-y

M3 - Article

SN - 0006-3835

VL - 56

SP - 189

EP - 239

JO - BIT Numerical Mathematics

JF - BIT Numerical Mathematics

IS - 1

ER -