Financial Mathematics and Supercomputing
|
|
- MargaretMargaret Robinson
- 5 years ago
- Views:
Transcription
1 GPU acceleration in early-exercise option valuation Álvaro Leitao and Cornelis W. Oosterlee Financial Mathematics and Supercomputing A Coruña - September 26, 2018 Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
2 Motivation Efficient valuation of early-exercise options. Novel method: combination of successful previous ideas. Originally introduced by Jain and Oosterlee in Multi-dimensional early-exercise option contracts. Increase the dimensionality. The technique becomes very expensive. Solution: parallelization of the method. GPU computing (GPGPU). Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
3 Outline 1 Definitions 2 Basket Bermudan Options 3 Stochastic Grid Bundling Method 4 Parallel GPU Implementation 5 Results 6 Conclusions Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
4 Definitions Option A contract that offers the buyer the right, but not the obligation, to buy (call) or sell (put) a financial asset at an agreed-upon price (the strike price) during a certain period of time or on a specific date (exercise date). Investopedia. Option price The fair value to enter in the option contract. In other words, the (discounted) expected value of the contract. V t = D t E [f (S t )] where f is the payoff function, S the underlying asset, t the exercise time and D t the discount factor. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
5 Definitions (II) Pricing techniques Stochastic process, S t, governing by a SDE. Simulation: Monte Carlo method. PDEs: Feynman-Kac theorem. Fourier inversion techniques: Characteristic function. Types of options - Exercise time European: End of the contract, t = T. American: Anytime, t [0, T ]. Bermudan: Some predefined times, t {t1,..., t M } Many others: Asian, barrier,... Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
6 Definitions (III) Early-exercise option price American: Bermudan: V t = V t = Pricing early-exercise options sup D t E [f (S t )]. t [0,T ] sup D t E [f (S t )]. t {t1,...,t M } PDEs: Hamilton-Jacobi-Bellman equation. Fourier inversion techniques: low dimensions. Simulation: Least-squares method (LSM), Longstaff and Schwartz. Stochastic Grid Bundling method (SGBM) [JO15]. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
7 Basket Bermudan Options Right to exercise at a set of times: t {t 0 = 0,..., t m,..., t M = T }. d-dimensional underlying process: S t = (S 1 t,..., S d t ) R d. Driven by a system of SDE in the form: ds 1 t = µ 1 (S t )dt + σ 1 (S t )dw 1 t, ds 2 t = µ 2 (S t )dt + σ 2 (S t )dw 2 t, ds d t. = µ d (S t )dt + σ d (S t )dw d t, where Wt δ, δ = 1, 2,..., d, are correlated standard Brownian motions. The instantaneous correlation coefficient between Wt i and Wt j is ρ i,j. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
8 Basket Bermudan Options (II) Intrinsic value of the option: h t := h(s t ). The value of the option at the terminal time T: V T (S T ) = f (S T ) = max(h(s T ), 0). The conditional continuation value Q tm, i.e. the discounted expected payoff at time t m : Q tm (S tm ) = D tm E [ V tm+1 (S tm+1 ) S tm ]. The Bermudan option value at time t m and state S tm : V tm (S tm ) = f (S T ) = max(h(s tm ), Q tm (S tm )). Value of the option at the initial state S t0, i.e. V t0 (S t0 ). Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
9 Basket Bermudan options scheme Figure: d-dimensional Bermudan option Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
10 Stochastic Grid Bundling Method Dynamic programming approach. Simulation and regression-based method. Forward in time: Monte Carlo simulation. Backward in time: Early-exercise policy computation. Step I: Generation of stochastic grid points {S t0 (n),..., S tm (n)}, n = 1,..., N. Step II: Option value at terminal time t M = T V tm (S tm ) = max(h(s tm ), 0). Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
11 Stochastic Grid Bundling Method (II) Backward in time, t m, m M,: Step III: Bundling into ν non-overlapping sets or partitions B tm 1 (1),..., B tm 1 (ν) Step IV: Parameterizing the option values Z(S tm, αt β m ) V tm (S tm ). Step V: Computing the continuation and option values at t m 1 Q tm 1 (S tm 1 (n)) = E[Z(S tm, αt β m ) S tm 1 (n)]. The option value is then given by: V tm 1 (S tm 1 (n)) = max(h(s tm 1 (n)), Q tm 1 (S tm 1 (n))). Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
12 Bundling Original: Iterative process (K-means clustering). Problems: Too expensive (time and memory) and distribution. New technique: Equal-partitioning. Efficient for parallelization. Two stages: sorting and splitting. SORT SPLIT Figure: Equal partitioning scheme Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
13 Parametrizing the option value Basis functions φ 1, φ 2,.. )., φ K. In our case, Z (S tm, αt β m depends on S tm only through φ k (S tm ): ) K Z (S tm, αt β m = αt β m (k)φ k (S tm ). k=1 Computation of αt β m (or α t β m ) by least squares regression. The αt β m determines the early-exercise policy. The continuation value: [( K ) ] Q tm 1 (S tm 1 (n)) = D tm 1 E α t β m (k)φ k (S tm ) S tm 1 k=1 K = D tm 1 α t β m (k)e [ ] φ k (S tm ) S tm 1. k=1 Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
14 Basis functions Choosing φ k : the expectations E [ ] φ k (S tm ) S tm 1 should be easy to calculate. The intrinsic value of the option, h( ), is usually an important and useful basis function. For example: Geometric basket Bermudan: h(s t ) = ( d δ=1 S δ t ) 1 d Arithmetic basket Bermudan: d h(s t ) = 1 d δ=1 S δ t m For S t following a GBM: expectations analytically available. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
15 Estimating the option value SGBM has been developed as duality-based method. Provide two estimators (confidence interval). Direct estimator (high-biased estimation): ( V tm 1 (S tm 1 (n)) = max h ( S tm 1 (n) ), Q ( tm 1 Stm 1 (n) )), E[ V t0 (S t0 )] = 1 N N V t0 (S t0 (n)). n=1 Path estimator (low-biased estimation): τ (S(n)) = min{t m : h (S tm (n)) Q tm (S tm (n)), m = 1,..., M}, v(n) = h ( S τ (S(n))), 1 V t0 (S t0 ) = lim NL N L N L v(n). n=1 Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
16 SGBM - schematic algorithm Data: S t0, X, µ δ, σ δ, ρ i,j, T, N, M Pre-Bundling (only in k-means case). Generation of the grid points (Monte Carlo). Step I. Option value at terminal time t = M. Step II. for Time t = (M 1)... 1 do Bundling. Step III. for Bundle β = 1... ν do Exercise policy (Regression). Step IV. Continuation value. Step V. Direct estimator. Step V. Generation of the grid points (Monte Carlo). Step I. Option value at terminal time t = M. Step II. for Time t = (M 1)... 1 do Bundling. Step III. for Bundle β = 1... ν do Continuation value. Step V. Path estimator. Step V. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
17 Continuation value computation: new approach More generally applicable. More involved models or options. First discretize, then derive the discrete characteristic function. S 1 t m+1 = S 1 tm + µ 1(S tm ) t + σ 1 (S tm ) W 1 t m+1, S 2 t m+1 = S 2 tm + µ 2(S tm ) t + ρ 1,2 σ 2 (S tm ) W 1 t m+1 + L 2,2 σ 2 (S tm ) W 2 t m+1, S d t m+1 = S d tm + µ d (S tm ) t + ρ 1,d σ d (S tm ) W 1 t m+1 + L 2,d σ d (S tm ) W 2 t m L d,d σ d (S tm ) W d t m+1, By definition, the d-variate discrete characteristic function: ( ) d ψ S u1, u t 2,..., u d S tm = E exp iu j S j m+1 t S tm m+1 j=1 d j = E exp iu j S j tm + µ j (S tm ) t + σ j (S tm ) L k,j W k t S tm m+1 j=1 k=1 d = exp iu j (S ) t) d d j tm + µ j (S tm E exp iu j L k,j σ j (S tm ) W k t m+1 j=1 k=1 j=k d = exp iu j (S ) t) d d j tm + µ j (S tm ψ N (0, t) u j L k,j σ j (S tm ), j=1 k=1 j=k Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
18 Continuation value computation: new approach Joint moments of the product: ) M Stm+1 = E [(S 1 c1 ) tm+1 (S 2 c2 ) tm+1 (S d cd ] tm+1 Stm [ ] = ( i) c 1+c 2 + +c c 1 +c 2 + +c d ψ Stm+1 (u S tm ) d u c 1 1 uc 2 2 uc d So, if the basis functions are the product of asset processes: ( d ) k 1 φ k (S tm ) = St δ m, k = 1,..., K, δ=1 This approximation is, in general, worse than the analytic one. Feasible thank to the GPU implementation: time steps. d u=0. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
19 Parallel SGBM on GPU NVIDIA CUDA platform. Parallel strategy: two parallelization stages: Forward: Monte Carlo simulation. Backward: Bundles Oportunity of parallelization. Novelty in early-exercise option pricing methods. Other methods: dependency and load-balancing problems. More bundles more paths. For high dimensions: huge amount of data (N M d). Efficient use of memory is required. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
20 Parallel SGBM on GPU - Forward in time One GPU thread per Monte Carlo simulation. Random numbers on the fly : curand library. Compute intermediate results: Expectations. Intrinsic value of the option. Equal-partitioning: sorting criterion calculations. Intermediate results in the registers: fast memory access. Original bundling: all the data still necessary. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
21 Parallel SGBM on GPU - Forward in time Figure: SGBM Monte Carlo Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
22 Parallel SGBM on GPU - Backward in time One parallelization stage per exercise time step. Sort w.r.t bundles: efficient memory access. Parallelization in bundles. Each bundle calculations (option value and early-exercise policy) in parallel. All GPU threads collaborate in order to compute the continuation value. Path estimator: One GPU thread per path (the early-exercise policy is already computed). Final reduction: Thrust library. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
23 Parallel SGBM on GPU - Bundling Two implementations K-means vs. Equal-partitioning. K-means clustering: K-means: sequential parts. K-means: transfers between CPU and GPU cannot be avoided. K-means: all data need to be stored. K-means: Load-balancing. Equal-partitioning: Equal-partitioning: fully parallelizable. Sorting library, CUDPP (Radix sort): kernel-level API. Equal-partitioning: No transfers. Equal-partitioning: efficient memory use. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
24 Parallel SGBM on GPU - Backward in time Figure: SGBM backward stage Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
25 Parallel SGBM on GPU - Backward in time Figure: SGBM backward stage Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
26 Parallel SGBM on GPU - Schematic algorithm Algorithm 1: Parallel SGBM. Data: S t0, X, µ δ, σ δ, ρ i,j, T, N, M // Generation of the grid points (Monte Carlo). Step I. // Option value at terminal time t = M. Step II. [payoffdata, critdata, expdata] = MonteCarloGPU(S t0, X, µ δ, σ δ, ρ i,j, T, N, M); for Time t = M... 1 do // Bundling. Step III. SortingGPU(critData[t-1]); begin CUDAThread per bundle β = 1... ν α β t = LeastSquaresRegression(payoffData[t]); // Exercise policy (Regression). Step IV. CV = ContinuationValue(α β t, expdata[t-1]); // Continuation value. Step V. DE = DirectEstimator(CV, payoffdata[t-1]); // Direct estimator. Step V. return DE; // Generation of the grid points (Monte Carlo). Step I. // Option value at terminal time t = M. Step II. [payoffdata, critdata, expdata] = MonteCarloGPU(S t0, X, µ δ, σ δ, ρ i,j, T, N, M); for Time t = M... 1 do SortingGPU(critData[t-1]); // Bundling. Step III. begin CUDAThread per path n = 1... N CV[n] = ContinuationValue(α β t, expdata[t-1]); // Continuation value. Step V. PE[n] = PathEstimator(CV[n], payoffdata[t-1]); // Path estimator. Step V. return PE; Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
27 Results Accelerator Island system of Cartesius Supercomputer. Intel Xeon E v2. NVIDIA Tesla K40m. C-compiler: GCC CUDA version: 5.5. Geometric and arithmetic basket Bermudan put options: S t0 = (40,..., 40) R d, X = 40, r t = 0.06, σ = (0.2,..., 0.2) R d, ρ ij = 0.25, T = 1 and M = 10. Basis functions: K = 3. Multi-dimensional Geometric Brownian Motion: µ δ (S t ) = r t S δ t, σ δ (S t ) = σ δ S δ t, δ = 1, 2,..., d, New approach: Euler discretization, δt = T /M, CEV model: with γ [0, 1]. µ δ (S t ) = r t S δ t, σ δ (S t ) = σ δ (S δ t ) γ, δ = 1, 2,..., d, Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
28 Equal-partitioning: convergence test d Reference price 5d Direct estimator 5d Path estimator 10d Reference price 10d Direct estimator 10d Path estimator 15d Reference price 15d Direct estimator 15d Path estimator d Direct estimator 5d Path estimator 10d Direct estimator 10d Path estimator 15d Direct estimator 15d Path estimator Vt0 (St0) 1.3 Vt0 (St0) Bundles ν (a) Geometric basket put option Bundles ν (b) Arithmetic basket put option Figure: Convergence with equal-partitioning bundling technique. Test configuration: N = 2 18 and t = T /M. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
29 Speedup - stages Geometric basket Bermudan option k-means equal-partitioning MC DE PE MC DE PE C CUDA Speedup Arithmetic basket Bermudan option k-means equal-partitioning MC DE PE MC DE PE C CUDA Speedup Table: SGBM stages time (s) for the C and CUDA versions. Test configuration: N = 2 22, t = T /M, d = 5 and ν = Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
30 Speedup - total Geometric basket Bermudan option k-means equal-partitioning d = 5 d = 10 d = 15 d = 5 d = 10 d = 15 C CUDA Speedup Arithmetic basket Bermudan option k-means equal-partitioning d = 5 d = 10 d = 15 d = 5 d = 10 d = 15 C CUDA Speedup Table: SGBM total time (s) for the C and CUDA versions. Test configuration: N = 2 22, t = T /M and ν = Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
31 Speedup - High dimensions Geometric basket Bermudan option ν = 2 10 ν = 2 14 d = 30 d = 40 d = 50 d = 30 d = 40 d = 50 C CUDA Speedup Arithmetic basket Bermudan option ν = 2 10 ν = 2 14 d = 30 d = 40 d = 50 d = 30 d = 40 d = 50 C CUDA Speedup Table: SGBM total time (s) for a high-dimensional problem with equal-partitioning. Test configuration: N = 2 20 and t = T /M. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
32 Cont. value computation: New approach Reference price Direct estimator Path estimator Reference price Direct estimator Path estimator 1.26 Vt0 (St0) Vt0 (St0) MC Steps = T/ t (a) Geometric basket put option MC Steps = T/ t (b) Arithmetic basket put option Figure: CEV model convergence, γ = 1.0. Test configuration: N = 2 16, ν = 2 10 and d = 5. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
33 Cont. value computation: New approach Geometric basket Bermudan option γ = 0.25 γ = 0.5 γ = 0.75 γ = 1.0 SGBM DE SGBM PE Arithmetic basket Bermudan option γ = 0.25 γ = 0.5 γ = 0.75 γ = 1.0 SGBM DE SGBM PE Table: CEV option pricing. Test configuration: N = 2 16, t = T /4000, ν = 2 10 and d = 5. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
34 Conclusions Efficient parallel GPU implementation. Extend the SGBM s applicability: Increasing dimensionality. New bundling technique. More general approach to compute the continuation value. Future work: Explore the new CUDA features: i.e. cusolver (QR factorization). CVA calculations. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
35 References Shashi Jain and Cornelis W. Oosterlee. The Stochastic Grid Bundling Method: Efficient pricing of Bermudan options and their Greeks. Applied Mathematics and Computation, 269: , Álvaro Leitao and Cornelis W. Oosterlee. GPU acceleration of the Stochastic Grid Bundling Method for early-exercise options. International Journal of Computer Mathematics, 92(12): , Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
36 Acknowledgements Thank you for your attention Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 36
37 Appendix Geo. basket Bermudan option - Basis functions: φ k (S tm ) = ( ( ) k 1 d St δ m ) 1 d, k = 1,..., K, δ=1 The expectation can directly be computed as: E [ φ k (S tm ) S tm 1 (n) ] = ( P tm 1 (n)e ( ) ) k 1 µ+ (k 1) σ2 t 2, where, ( d P tm 1 (n) = St δ m 1 (n) δ=1 ) 1 d ( d, µ = 1 d δ=1 r q δ σ2 δ 2 ), σ 2 = 1 d 2 2 d d Cpq 2. p=1 q=1 Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 3
38 Appendix Arith. basket Bermudan option - Basis functions: φ k (S tm ) = ( 1 d ) k 1 d St δ m, k = 1,..., K., δ=1 The summation can be expressed as a linear combination of the products: ( d ) k St δ m = δ=1 k 1 +k 2 + +k d =k ( k k 1, k 2,..., k d ) 1 δ d ( S δ t m ) kδ, And the expression for Geometric basket option can be applied. Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 3
39 Á. Leitao & Kees Oosterlee SGBM on GPU A Coruña - September 26, / 3
Stochastic Grid Bundling Method
Stochastic Grid Bundling Method GPU Acceleration Delft University of Technology - Centrum Wiskunde & Informatica Álvaro Leitao Rodríguez and Cornelis W. Oosterlee London - December 17, 2015 A. Leitao &
More informationPricing Early-exercise options
Pricing Early-exercise options GPU Acceleration of SGBM method Delft University of Technology - Centrum Wiskunde & Informatica Álvaro Leitao Rodríguez and Cornelis W. Oosterlee Lausanne - December 4, 2016
More informationThe Stochastic Grid Bundling Method: Efficient Pricing of Bermudan Options and their Greeks
The Stochastic Grid Bundling Method: Efficient Pricing of Bermudan Options and their Greeks Shashi Jain Cornelis W. Oosterlee September 4, 2013 Abstract This paper describes a practical simulation-based
More informationFourier, Wavelet and Monte Carlo Methods in Computational Finance
Fourier, Wavelet and Monte Carlo Methods in Computational Finance Kees Oosterlee 1,2 1 CWI, Amsterdam 2 Delft University of Technology, the Netherlands AANMPDE-9-16, 7/7/26 Kees Oosterlee (CWI, TU Delft)
More informationBarrier Option. 2 of 33 3/13/2014
FPGA-based Reconfigurable Computing for Pricing Multi-Asset Barrier Options RAHUL SRIDHARAN, GEORGE COOKE, KENNETH HILL, HERMAN LAM, ALAN GEORGE, SAAHPC '12, PROCEEDINGS OF THE 2012 SYMPOSIUM ON APPLICATION
More informationComputational Finance Improving Monte Carlo
Computational Finance Improving Monte Carlo School of Mathematics 2018 Monte Carlo so far... Simple to program and to understand Convergence is slow, extrapolation impossible. Forward looking method ideal
More information2.1 Mathematical Basis: Risk-Neutral Pricing
Chapter Monte-Carlo Simulation.1 Mathematical Basis: Risk-Neutral Pricing Suppose that F T is the payoff at T for a European-type derivative f. Then the price at times t before T is given by f t = e r(t
More informationTo link to this article:
This article was downloaded by: [Centrum Wiskunde & Informatica] On: 24 July 2012, At: 02:56 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered
More informationPRICING AMERICAN OPTIONS WITH LEAST SQUARES MONTE CARLO ON GPUS. Massimiliano Fatica, NVIDIA Corporation
PRICING AMERICAN OPTIONS WITH LEAST SQUARES MONTE CARLO ON GPUS Massimiliano Fatica, NVIDIA Corporation OUTLINE! Overview! Least Squares Monte Carlo! GPU implementation! Results! Conclusions OVERVIEW!
More informationMONTE CARLO EXTENSIONS
MONTE CARLO EXTENSIONS School of Mathematics 2013 OUTLINE 1 REVIEW OUTLINE 1 REVIEW 2 EXTENSION TO MONTE CARLO OUTLINE 1 REVIEW 2 EXTENSION TO MONTE CARLO 3 SUMMARY MONTE CARLO SO FAR... Simple to program
More information- 1 - **** d(lns) = (µ (1/2)σ 2 )dt + σdw t
- 1 - **** These answers indicate the solutions to the 2014 exam questions. Obviously you should plot graphs where I have simply described the key features. It is important when plotting graphs to label
More informationAlgorithmic Differentiation of a GPU Accelerated Application
of a GPU Accelerated Application Numerical Algorithms Group 1/31 Disclaimer This is not a speedup talk There won t be any speed or hardware comparisons here This is about what is possible and how to do
More information"Pricing Exotic Options using Strong Convergence Properties
Fourth Oxford / Princeton Workshop on Financial Mathematics "Pricing Exotic Options using Strong Convergence Properties Klaus E. Schmitz Abe schmitz@maths.ox.ac.uk www.maths.ox.ac.uk/~schmitz Prof. Mike
More informationComputational Finance
Path Dependent Options Computational Finance School of Mathematics 2018 The Random Walk One of the main assumption of the Black-Scholes framework is that the underlying stock price follows a random walk
More informationFinancial Risk Modeling on Low-power Accelerators: Experimental Performance Evaluation of TK1 with FPGA
Financial Risk Modeling on Low-power Accelerators: Experimental Performance Evaluation of TK1 with FPGA Rajesh Bordawekar and Daniel Beece IBM T. J. Watson Research Center 3/17/2015 2014 IBM Corporation
More informationMultilevel Monte Carlo Simulation
Multilevel Monte Carlo p. 1/48 Multilevel Monte Carlo Simulation Mike Giles mike.giles@maths.ox.ac.uk Oxford University Mathematical Institute Oxford-Man Institute of Quantitative Finance Workshop on Computational
More informationMonte-Carlo Pricing under a Hybrid Local Volatility model
Monte-Carlo Pricing under a Hybrid Local Volatility model Mizuho International plc GPU Technology Conference San Jose, 14-17 May 2012 Introduction Key Interests in Finance Pricing of exotic derivatives
More informationTwo-dimensional COS method
Two-dimensional COS method Marjon Ruijter Winterschool Lunteren 22 January 2013 1/29 Introduction PhD student since October 2010 Prof.dr.ir. C.W. Oosterlee). CWI national research center for mathematics
More informationMonte Carlo Methods for Uncertainty Quantification
Monte Carlo Methods for Uncertainty Quantification Mike Giles Mathematical Institute, University of Oxford Contemporary Numerical Techniques Mike Giles (Oxford) Monte Carlo methods 2 1 / 24 Lecture outline
More information"Vibrato" Monte Carlo evaluation of Greeks
"Vibrato" Monte Carlo evaluation of Greeks (Smoking Adjoints: part 3) Mike Giles mike.giles@maths.ox.ac.uk Oxford University Mathematical Institute Oxford-Man Institute of Quantitative Finance MCQMC 2008,
More informationAnurag Sodhi University of North Carolina at Charlotte
American Put Option pricing using Least squares Monte Carlo method under Bakshi, Cao and Chen Model Framework (1997) and comparison to alternative regression techniques in Monte Carlo Anurag Sodhi University
More informationOptimized Least-squares Monte Carlo (OLSM) for Measuring Counterparty Credit Exposure of American-style Options
Optimized Least-squares Monte Carlo (OLSM) for Measuring Counterparty Credit Exposure of American-style Options Kin Hung (Felix) Kan 1 Greg Frank 3 Victor Mozgin 3 Mark Reesor 2 1 Department of Applied
More informationMonte Carlo Simulations
Monte Carlo Simulations Lecture 1 December 7, 2014 Outline Monte Carlo Methods Monte Carlo methods simulate the random behavior underlying the financial models Remember: When pricing you must simulate
More informationThe Use of Importance Sampling to Speed Up Stochastic Volatility Simulations
The Use of Importance Sampling to Speed Up Stochastic Volatility Simulations Stan Stilger June 6, 1 Fouque and Tullie use importance sampling for variance reduction in stochastic volatility simulations.
More informationEquity correlations implied by index options: estimation and model uncertainty analysis
1/18 : estimation and model analysis, EDHEC Business School (joint work with Rama COT) Modeling and managing financial risks Paris, 10 13 January 2011 2/18 Outline 1 2 of multi-asset models Solution to
More informationNEWCASTLE UNIVERSITY SCHOOL OF MATHEMATICS, STATISTICS & PHYSICS SEMESTER 1 SPECIMEN 2 MAS3904. Stochastic Financial Modelling. Time allowed: 2 hours
NEWCASTLE UNIVERSITY SCHOOL OF MATHEMATICS, STATISTICS & PHYSICS SEMESTER 1 SPECIMEN 2 Stochastic Financial Modelling Time allowed: 2 hours Candidates should attempt all questions. Marks for each question
More informationMonte Carlo Methods in Structuring and Derivatives Pricing
Monte Carlo Methods in Structuring and Derivatives Pricing Prof. Manuela Pedio (guest) 20263 Advanced Tools for Risk Management and Pricing Spring 2017 Outline and objectives The basic Monte Carlo algorithm
More informationMultilevel Monte Carlo for Basket Options
MLMC for basket options p. 1/26 Multilevel Monte Carlo for Basket Options Mike Giles mike.giles@maths.ox.ac.uk Oxford University Mathematical Institute Oxford-Man Institute of Quantitative Finance WSC09,
More informationAD in Monte Carlo for finance
AD in Monte Carlo for finance Mike Giles giles@comlab.ox.ac.uk Oxford University Computing Laboratory AD & Monte Carlo p. 1/30 Overview overview of computational finance stochastic o.d.e. s Monte Carlo
More informationParallel Multilevel Monte Carlo Simulation
Parallel Simulation Mathematisches Institut Goethe-Universität Frankfurt am Main Advances in Financial Mathematics Paris January 7-10, 2014 Simulation Outline 1 Monte Carlo 2 3 4 Algorithm Numerical Results
More informationNumerical schemes for SDEs
Lecture 5 Numerical schemes for SDEs Lecture Notes by Jan Palczewski Computational Finance p. 1 A Stochastic Differential Equation (SDE) is an object of the following type dx t = a(t,x t )dt + b(t,x t
More informationForward Monte-Carlo Scheme for PDEs: Multi-Type Marked Branching Diffusions
Forward Monte-Carlo Scheme for PDEs: Multi-Type Marked Branching Diffusions Pierre Henry-Labordère 1 1 Global markets Quantitative Research, SOCIÉTÉ GÉNÉRALE Outline 1 Introduction 2 Semi-linear PDEs 3
More informationKing s College London
King s College London University Of London This paper is part of an examination of the College counting towards the award of a degree. Examinations are governed by the College Regulations under the authority
More informationOption Pricing with the SABR Model on the GPU
Option Pricing with the SABR Model on the GPU Yu Tian, Zili Zhu, Fima C. Klebaner and Kais Hamza School of Mathematical Sciences, Monash University, Clayton, VIC3800, Australia Email: {yu.tian, fima.klebaner,
More informationNAG for HPC in Finance
NAG for HPC in Finance John Holden Jacques Du Toit 3 rd April 2014 Computation in Finance and Insurance, post Napier Experts in numerical algorithms and HPC services Agenda NAG and Financial Services Why
More informationPolicy iterated lower bounds and linear MC upper bounds for Bermudan style derivatives
Finance Winterschool 2007, Lunteren NL Policy iterated lower bounds and linear MC upper bounds for Bermudan style derivatives Pricing complex structured products Mohrenstr 39 10117 Berlin schoenma@wias-berlin.de
More informationCS 774 Project: Fall 2009 Version: November 27, 2009
CS 774 Project: Fall 2009 Version: November 27, 2009 Instructors: Peter Forsyth, paforsyt@uwaterloo.ca Office Hours: Tues: 4:00-5:00; Thurs: 11:00-12:00 Lectures:MWF 3:30-4:20 MC2036 Office: DC3631 CS
More informationMethods for Pricing Strongly Path-Dependent Options in Libor Market Models without Simulation
Methods for Pricing Strongly Options in Libor Market Models without Simulation Chris Kenyon DEPFA BANK plc. Workshop on Computational Methods for Pricing and Hedging Exotic Options W M I July 9, 2008 1
More informationSimulating Stochastic Differential Equations
IEOR E4603: Monte-Carlo Simulation c 2017 by Martin Haugh Columbia University Simulating Stochastic Differential Equations In these lecture notes we discuss the simulation of stochastic differential equations
More informationMonte-Carlo Methods in Financial Engineering
Monte-Carlo Methods in Financial Engineering Universität zu Köln May 12, 2017 Outline Table of Contents 1 Introduction 2 Repetition Definitions Least-Squares Method 3 Derivation Mathematical Derivation
More informationComputational Efficiency and Accuracy in the Valuation of Basket Options. Pengguo Wang 1
Computational Efficiency and Accuracy in the Valuation of Basket Options Pengguo Wang 1 Abstract The complexity involved in the pricing of American style basket options requires careful consideration of
More informationF1 Acceleration for Montecarlo: financial algorithms on FPGA
F1 Acceleration for Montecarlo: financial algorithms on FPGA Presented By Liang Ma, Luciano Lavagno Dec 10 th 2018 Contents Financial problems and mathematical models High level synthesis Optimization
More informationMulti-level Stochastic Valuations
Multi-level Stochastic Valuations 14 March 2016 High Performance Computing in Finance Conference 2016 Grigorios Papamanousakis Quantitative Strategist, Investment Solutions Aberdeen Asset Management 0
More informationKing s College London
King s College London University Of London This paper is part of an examination of the College counting towards the award of a degree. Examinations are governed by the College Regulations under the authority
More informationMath 416/516: Stochastic Simulation
Math 416/516: Stochastic Simulation Haijun Li lih@math.wsu.edu Department of Mathematics Washington State University Week 13 Haijun Li Math 416/516: Stochastic Simulation Week 13 1 / 28 Outline 1 Simulation
More informationModern Methods of Option Pricing
Modern Methods of Option Pricing Denis Belomestny Weierstraß Institute Berlin Motzen, 14 June 2007 Denis Belomestny (WIAS) Modern Methods of Option Pricing Motzen, 14 June 2007 1 / 30 Overview 1 Introduction
More informationValuing American Options by Simulation
Valuing American Options by Simulation Hansjörg Furrer Market-consistent Actuarial Valuation ETH Zürich, Frühjahrssemester 2008 Valuing American Options Course material Slides Longstaff, F. A. and Schwartz,
More informationMonte Carlo Based Numerical Pricing of Multiple Strike-Reset Options
Monte Carlo Based Numerical Pricing of Multiple Strike-Reset Options Stavros Christodoulou Linacre College University of Oxford MSc Thesis Trinity 2011 Contents List of figures ii Introduction 2 1 Strike
More informationOutline. GPU for Finance SciFinance SciFinance CUDA Risk Applications Testing. Conclusions. Monte Carlo PDE
Outline GPU for Finance SciFinance SciFinance CUDA Risk Applications Testing Monte Carlo PDE Conclusions 2 Why GPU for Finance? Need for effective portfolio/risk management solutions Accurately measuring,
More informationHeston Stochastic Local Volatility Model
Heston Stochastic Local Volatility Model Klaus Spanderen 1 R/Finance 2016 University of Illinois, Chicago May 20-21, 2016 1 Joint work with Johannes Göttker-Schnetmann Klaus Spanderen Heston Stochastic
More informationMonte Carlo Greeks in the lognormal Libor market model
Delft University of Technology Faculty of Electrical Engineering, Mathematics and Computer Science Delft Institute of Applied Mathematics Monte Carlo Greeks in the lognormal Libor market model A thesis
More informationIEOR E4703: Monte-Carlo Simulation
IEOR E4703: Monte-Carlo Simulation Simulating Stochastic Differential Equations Martin Haugh Department of Industrial Engineering and Operations Research Columbia University Email: martin.b.haugh@gmail.com
More informationAMH4 - ADVANCED OPTION PRICING. Contents
AMH4 - ADVANCED OPTION PRICING ANDREW TULLOCH Contents 1. Theory of Option Pricing 2 2. Black-Scholes PDE Method 4 3. Martingale method 4 4. Monte Carlo methods 5 4.1. Method of antithetic variances 5
More informationA Moment Matching Approach To The Valuation Of A Volume Weighted Average Price Option
A Moment Matching Approach To The Valuation Of A Volume Weighted Average Price Option Antony Stace Department of Mathematics and MASCOS University of Queensland 15th October 2004 AUSTRALIAN RESEARCH COUNCIL
More informationRegression estimation in continuous time with a view towards pricing Bermudan options
with a view towards pricing Bermudan options Tagung des SFB 649 Ökonomisches Risiko in Motzen 04.-06.06.2009 Financial engineering in times of financial crisis Derivate... süßes Gift für die Spekulanten
More informationOptimal Search for Parameters in Monte Carlo Simulation for Derivative Pricing
Optimal Search for Parameters in Monte Carlo Simulation for Derivative Pricing Prof. Chuan-Ju Wang Department of Computer Science University of Taipei Joint work with Prof. Ming-Yang Kao March 28, 2014
More informationToward a coherent Monte Carlo simulation of CVA
Toward a coherent Monte Carlo simulation of CVA Lokman Abbas-Turki (Joint work with A. I. Bouselmi & M. A. Mikou) TU Berlin January 9, 2013 Lokman (TU Berlin) Advances in Mathematical Finance 1 / 16 Plan
More informationJDEP 384H: Numerical Methods in Business
Chapter 4: Numerical Integration: Deterministic and Monte Carlo Methods Chapter 8: Option Pricing by Monte Carlo Methods JDEP 384H: Numerical Methods in Business Instructor: Thomas Shores Department of
More informationAnumericalalgorithm for general HJB equations : a jump-constrained BSDE approach
Anumericalalgorithm for general HJB equations : a jump-constrained BSDE approach Nicolas Langrené Univ. Paris Diderot - Sorbonne Paris Cité, LPMA, FiME Joint work with Idris Kharroubi (Paris Dauphine),
More informationThe data-driven COS method
The data-driven COS method Á. Leitao, C. W. Oosterlee, L. Ortiz-Gracia and S. M. Bohte Delft University of Technology - Centrum Wiskunde & Informatica CMMSE 2017, July 6, 2017 Álvaro Leitao (CWI & TUDelft)
More informationMonte Carlo Methods for Uncertainty Quantification
Monte Carlo Methods for Uncertainty Quantification Abdul-Lateef Haji-Ali Based on slides by: Mike Giles Mathematical Institute, University of Oxford Contemporary Numerical Techniques Haji-Ali (Oxford)
More informationRecovering portfolio default intensities implied by CDO quotes. Rama CONT & Andreea MINCA. March 1, Premia 14
Recovering portfolio default intensities implied by CDO quotes Rama CONT & Andreea MINCA March 1, 2012 1 Introduction Premia 14 Top-down" models for portfolio credit derivatives have been introduced as
More informationThe data-driven COS method
The data-driven COS method Á. Leitao, C. W. Oosterlee, L. Ortiz-Gracia and S. M. Bohte Delft University of Technology - Centrum Wiskunde & Informatica Reading group, March 13, 2017 Reading group, March
More informationGRAPHICAL ASIAN OPTIONS
GRAPHICAL ASIAN OPTIONS MARK S. JOSHI Abstract. We discuss the problem of pricing Asian options in Black Scholes model using CUDA on a graphics processing unit. We survey some of the issues with GPU programming
More informationPricing and Modelling in Electricity Markets
Pricing and Modelling in Electricity Markets Ben Hambly Mathematical Institute University of Oxford Pricing and Modelling in Electricity Markets p. 1 Electricity prices Over the past 20 years a number
More informationEFFICIENT MONTE CARLO ALGORITHM FOR PRICING BARRIER OPTIONS
Commun. Korean Math. Soc. 23 (2008), No. 2, pp. 285 294 EFFICIENT MONTE CARLO ALGORITHM FOR PRICING BARRIER OPTIONS Kyoung-Sook Moon Reprinted from the Communications of the Korean Mathematical Society
More informationThe Pennsylvania State University. The Graduate School. Department of Industrial Engineering AMERICAN-ASIAN OPTION PRICING BASED ON MONTE CARLO
The Pennsylvania State University The Graduate School Department of Industrial Engineering AMERICAN-ASIAN OPTION PRICING BASED ON MONTE CARLO SIMULATION METHOD A Thesis in Industrial Engineering and Operations
More informationAsymptotic Method for Singularity in Path-Dependent Option Pricing
Asymptotic Method for Singularity in Path-Dependent Option Pricing Sang-Hyeon Park, Jeong-Hoon Kim Dept. Math. Yonsei University June 2010 Singularity in Path-Dependent June 2010 Option Pricing 1 / 21
More informationRisk Neutral Valuation
copyright 2012 Christian Fries 1 / 51 Risk Neutral Valuation Christian Fries Version 2.2 http://www.christian-fries.de/finmath April 19-20, 2012 copyright 2012 Christian Fries 2 / 51 Outline Notation Differential
More informationDomokos Vermes. Min Zhao
Domokos Vermes and Min Zhao WPI Financial Mathematics Laboratory BSM Assumptions Gaussian returns Constant volatility Market Reality Non-zero skew Positive and negative surprises not equally likely Excess
More informationModeling Path Dependent Derivatives Using CUDA Parallel Platform
Modeling Path Dependent Derivatives Using CUDA Parallel Platform A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Mathematical Sciences in the Graduate School of The
More informationImproved Lower and Upper Bound Algorithms for Pricing American Options by Simulation
Improved Lower and Upper Bound Algorithms for Pricing American Options by Simulation Mark Broadie and Menghui Cao December 2007 Abstract This paper introduces new variance reduction techniques and computational
More informationUsing radial basis functions for option pricing
Using radial basis functions for option pricing Elisabeth Larsson Division of Scientific Computing Department of Information Technology Uppsala University Actuarial Mathematics Workshop, March 19, 2013,
More informationAccelerated Option Pricing Multiple Scenarios
Accelerated Option Pricing in Multiple Scenarios 04.07.2008 Stefan Dirnstorfer (stefan@thetaris.com) Andreas J. Grau (grau@thetaris.com) 1 Abstract This paper covers a massive acceleration of Monte-Carlo
More informationAn Analytical Approximation for Pricing VWAP Options
.... An Analytical Approximation for Pricing VWAP Options Hideharu Funahashi and Masaaki Kijima Graduate School of Social Sciences, Tokyo Metropolitan University September 4, 215 Kijima (TMU Pricing of
More informationIEOR E4703: Monte-Carlo Simulation
IEOR E4703: Monte-Carlo Simulation Other Miscellaneous Topics and Applications of Monte-Carlo Martin Haugh Department of Industrial Engineering and Operations Research Columbia University Email: martin.b.haugh@gmail.com
More informationAnalytical formulas for local volatility model with stochastic. Mohammed Miri
Analytical formulas for local volatility model with stochastic rates Mohammed Miri Joint work with Eric Benhamou (Pricing Partners) and Emmanuel Gobet (Ecole Polytechnique Modeling and Managing Financial
More informationFast and accurate pricing of discretely monitored barrier options by numerical path integration
Comput Econ (27 3:143 151 DOI 1.17/s1614-7-991-5 Fast and accurate pricing of discretely monitored barrier options by numerical path integration Christian Skaug Arvid Naess Received: 23 December 25 / Accepted:
More informationInterest Rate Bermudan Swaption Valuation and Risk
Interest Rate Bermudan Swaption Valuation and Risk Dmitry Popov FinPricing http://www.finpricing.com Summary Bermudan Swaption Definition Bermudan Swaption Payoffs Valuation Model Selection Criteria LGM
More informationMonte Carlo Methods in Finance
Monte Carlo Methods in Finance Peter Jackel JOHN WILEY & SONS, LTD Preface Acknowledgements Mathematical Notation xi xiii xv 1 Introduction 1 2 The Mathematics Behind Monte Carlo Methods 5 2.1 A Few Basic
More informationAccelerating Financial Computation
Accelerating Financial Computation Wayne Luk Department of Computing Imperial College London HPC Finance Conference and Training Event Computational Methods and Technologies for Finance 13 May 2013 1 Accelerated
More informationOptimal Stopping for American Type Options
Optimal Stopping for Department of Mathematics Stockholm University Sweden E-mail: silvestrov@math.su.se ISI 2011, Dublin, 21-26 August 2011 Outline of communication Multivariate Modulated Markov price
More informationInvestment strategies and risk management for participating life insurance contracts
1/20 Investment strategies and risk for participating life insurance contracts and Steven Haberman Cass Business School AFIR Colloquium Munich, September 2009 2/20 & Motivation Motivation New supervisory
More informationVaR Estimation under Stochastic Volatility Models
VaR Estimation under Stochastic Volatility Models Chuan-Hsiang Han Dept. of Quantitative Finance Natl. Tsing-Hua University TMS Meeting, Chia-Yi (Joint work with Wei-Han Liu) December 5, 2009 Outline Risk
More informationStochastic modelling of electricity markets Pricing Forwards and Swaps
Stochastic modelling of electricity markets Pricing Forwards and Swaps Jhonny Gonzalez School of Mathematics The University of Manchester Magical books project August 23, 2012 Clip for this slide Pricing
More informationLecture 4. Finite difference and finite element methods
Finite difference and finite element methods Lecture 4 Outline Black-Scholes equation From expectation to PDE Goal: compute the value of European option with payoff g which is the conditional expectation
More informationValuation of Asian Option. Qi An Jingjing Guo
Valuation of Asian Option Qi An Jingjing Guo CONTENT Asian option Pricing Monte Carlo simulation Conclusion ASIAN OPTION Definition of Asian option always emphasizes the gist that the payoff depends on
More informationValuation of performance-dependent options in a Black- Scholes framework
Valuation of performance-dependent options in a Black- Scholes framework Thomas Gerstner, Markus Holtz Institut für Numerische Simulation, Universität Bonn, Germany Ralf Korn Fachbereich Mathematik, TU
More informationFast Convergence of Regress-later Series Estimators
Fast Convergence of Regress-later Series Estimators New Thinking in Finance, London Eric Beutner, Antoon Pelsser, Janina Schweizer Maastricht University & Kleynen Consultants 12 February 2014 Beutner Pelsser
More informationComputational Finance. Computational Finance p. 1
Computational Finance Computational Finance p. 1 Outline Binomial model: option pricing and optimal investment Monte Carlo techniques for pricing of options pricing of non-standard options improving accuracy
More informationStochastic Differential Equations in Finance and Monte Carlo Simulations
Stochastic Differential Equations in Finance and Department of Statistics and Modelling Science University of Strathclyde Glasgow, G1 1XH China 2009 Outline Stochastic Modelling in Asset Prices 1 Stochastic
More informationA Dynamic Programming Approach to Price Installment Options
A Dynamic Programming Approach to Price Installment Options Hatem Ben-Ameur Michèle Breton Pascal François April 2004 Corresponding author: Michèle Breton, Centre for Research on e-finance, 3000 Côte-
More informationSupplementary Appendix to The Risk Premia Embedded in Index Options
Supplementary Appendix to The Risk Premia Embedded in Index Options Torben G. Andersen Nicola Fusari Viktor Todorov December 214 Contents A The Non-Linear Factor Structure of Option Surfaces 2 B Additional
More informationCredit Valuation Adjustment and Funding Valuation Adjustment
Credit Valuation Adjustment and Funding Valuation Adjustment Alex Yang FinPricing http://www.finpricing.com Summary Credit Valuation Adjustment (CVA) Definition Funding Valuation Adjustment (FVA) Definition
More informationPractical example of an Economic Scenario Generator
Practical example of an Economic Scenario Generator Martin Schenk Actuarial & Insurance Solutions SAV 7 March 2014 Agenda Introduction Deterministic vs. stochastic approach Mathematical model Application
More informationIntroduction to Affine Processes. Applications to Mathematical Finance
and Its Applications to Mathematical Finance Department of Mathematical Science, KAIST Workshop for Young Mathematicians in Korea, 2010 Outline Motivation 1 Motivation 2 Preliminary : Stochastic Calculus
More informationMAFS5250 Computational Methods for Pricing Structured Products Topic 5 - Monte Carlo simulation
MAFS5250 Computational Methods for Pricing Structured Products Topic 5 - Monte Carlo simulation 5.1 General formulation of the Monte Carlo procedure Expected value and variance of the estimate Multistate
More informationComputational Finance Least Squares Monte Carlo
Computational Finance Least Squares Monte Carlo School of Mathematics 2019 Monte Carlo and Binomial Methods In the last two lectures we discussed the binomial tree method and convergence problems. One
More informationComputer Exercise 2 Simulation
Lund University with Lund Institute of Technology Valuation of Derivative Assets Centre for Mathematical Sciences, Mathematical Statistics Fall 2017 Computer Exercise 2 Simulation This lab deals with pricing
More informationAccelerating Quantitative Financial Computing with CUDA and GPUs
Accelerating Quantitative Financial Computing with CUDA and GPUs NVIDIA GPU Technology Conference San Jose, California Gerald A. Hanweck, Jr., PhD CEO, Hanweck Associates, LLC Hanweck Associates, LLC 30
More information