TY - JOUR
T1 - Variance reduction methods and multilevel monte carlo strategy for estimating densities of solutions to random second-order linear differential equations
AU - Jornet, Marc
AU - Calatayud, Julia
AU - Le Maître, Olivier P.
AU - Cortés, Juan Carlos
N1 - Publisher Copyright:
© 2020 by Begell House, Inc.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - This paper concerns the estimation of the density function of the solution to a random nonautonomous second-order linear differential equation with analytic data processes. In a recent contribution, we proposed to express the density function as an expectation, and we used a standard Monte Carlo algorithm to approximate the expectation. Although the algorithms worked satisfactorily for most test problems, some numerical challenges emerged for others, due to large statistical errors. In these situations, the convergence of the Monte Carlo simulation slows down severely, and noisy features plague the estimates. In this paper, we focus on computational aspects and propose several variance reduction methods to remedy these issues and speed up the convergence. First, we introduce a pathwise selection of the approximating processes which aims at controlling the variance of the estimator. Second, we propose a hybrid method, combining Monte Carlo and deterministic quadrature rules, to estimate the expectation. Third, we exploit the series expansions of the solutions to design a multilevel Monte Carlo estimator. The proposed methods are implemented and tested on several numerical examples to highlight the theoretical discussions and demonstrate the significant improvements achieved.
AB - This paper concerns the estimation of the density function of the solution to a random nonautonomous second-order linear differential equation with analytic data processes. In a recent contribution, we proposed to express the density function as an expectation, and we used a standard Monte Carlo algorithm to approximate the expectation. Although the algorithms worked satisfactorily for most test problems, some numerical challenges emerged for others, due to large statistical errors. In these situations, the convergence of the Monte Carlo simulation slows down severely, and noisy features plague the estimates. In this paper, we focus on computational aspects and propose several variance reduction methods to remedy these issues and speed up the convergence. First, we introduce a pathwise selection of the approximating processes which aims at controlling the variance of the estimator. Second, we propose a hybrid method, combining Monte Carlo and deterministic quadrature rules, to estimate the expectation. Third, we exploit the series expansions of the solutions to design a multilevel Monte Carlo estimator. The proposed methods are implemented and tested on several numerical examples to highlight the theoretical discussions and demonstrate the significant improvements achieved.
KW - Analysis of algorithms
KW - Probability density function
KW - Random linear differential equation
KW - Standard and multilevel Monte Carlo simulation
U2 - 10.1615/Int.J.UncertaintyQuantification.2020032659
DO - 10.1615/Int.J.UncertaintyQuantification.2020032659
M3 - Article
AN - SCOPUS:85099385898
SN - 2152-5080
VL - 10
SP - 467
EP - 497
JO - International Journal for Uncertainty Quantification
JF - International Journal for Uncertainty Quantification
IS - 5
ER -