Globally Adaptive Control Variate for Robust Numerical Integration
نویسندگان
چکیده
منابع مشابه
Globally Adaptive Control Variate for Robust Numerical Integration
Many methods in computer graphics require the integration of functions on lowto-middle-dimensional spaces. However, no available method can handle all the possible integrands accurately and rapidly. This paper presents a robust numerical integration method, able to handle arbitrary non-singular scalar or vector-valued functions defined on low-to-middle-dimensional spaces. Our method combines co...
متن کاملAdaptive Numerical Integration and Control Variates for Pricing Basket Options
We develop a numerical method for pricing multidimensional vanilla options in the Black-Scholes framework. In low dimensions, we improve an adaptive integration algorithm proposed by two of the authors by introducing a new splitting strategy based on a geometrical criterion. In higher dimensions, this new algorithm is used as a control variate after a dimension reduction based on principal comp...
متن کاملSolving BSDE with Adaptive Control Variate
We present and analyze an algorithm to solve numerically BSDEs based on Picard’s iterations and on a sequential control variate technique. Its convergence is geometric. Moreover, the solution provided by our algorithm is regular both w.r.t. time and space.
متن کاملRobust numerical methods for robust control
We present numerical methods for the solution of the optimal H∞ control problem. In particular, we investigate the iterative part often called the γ-iteration. We derive a method with better robustness in the presence of rounding errors than other existing methods. It remains robust in the presence of rounding errors even as γ approaches its optimal value. For the computation of a suboptimal co...
متن کاملParallel Globally Adaptive Algorithms for Multi-dimensional Integration
We address the problem of implementing globally adaptive algorithms for multi-dimensional numerical integration on parallel computers. By adapting and extending algorithms which we have developed for one-dimensional quadrature we develop algorithms for the multi-dimensional case. The algorithms are targeted at the lat-est generation of parallel computers, and are therefore independent of the ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2014
ISSN: 1064-8275,1095-7197
DOI: 10.1137/130937846