Computational Methods for Quantitative Finance: Finite by Norbert Hilber, Oleg Reichmann, Christoph Schwab, Christoph

By Norbert Hilber, Oleg Reichmann, Christoph Schwab, Christoph Winter

Many mathematical assumptions on which classical by-product pricing equipment are dependent have come below scrutiny lately. the current quantity bargains an advent to deterministic algorithms for the short and exact pricing of by-product contracts in glossy finance. This unified, non-Monte-Carlo computational pricing technique is able to dealing with particularly normal sessions of stochastic marketplace versions with jumps, together with, specifically, all at the moment used Lévy and stochastic volatility versions. It permits us e.g. to quantify version possibility in computed costs on simple vanilla, in addition to on numerous different types of unique contracts. The algorithms are constructed in classical Black-Scholes markets, after which prolonged to marketplace types in line with multiscale stochastic volatility, to Lévy, additive and likely sessions of Feller tactics. This e-book is meant for graduate scholars and researchers, in addition to for practitioners within the fields of quantitative finance and utilized and computational arithmetic with an exceptional heritage in arithmetic, information or economics.​

Table of Contents


Computational tools for Quantitative Finance - Finite aspect equipment for by-product Pricing

ISBN 9783642354007 ISBN 9783642354014



Part I simple recommendations and Models

Notions of Mathematical Finance
1.1 monetary Modelling
1.2 Stochastic Processes
1.3 extra Reading
parts of Numerical equipment for PDEs
2.1 functionality Spaces
2.2 Partial Differential Equations
2.3 Numerical equipment for the warmth Equation
o 2.3.1 Finite distinction Method
o 2.3.2 Convergence of the Finite distinction Method
o 2.3.3 Finite point Method
2.4 extra Reading
Finite point equipment for Parabolic Problems
3.1 Sobolev Spaces
3.2 Variational Parabolic Framework
3.3 Discretization
3.4 Implementation of the Matrix Form
o 3.4.1 Elemental kinds and Assembly
o 3.4.2 preliminary Data
3.5 balance of the .-Scheme
3.6 blunders Estimates
o 3.6.1 Finite aspect Interpolation
o 3.6.2 Convergence of the Finite aspect Method
3.7 additional Reading
eu techniques in BS Markets
4.1 Black-Scholes Equation
4.2 Variational Formulation
4.3 Localization
4.4 Discretization
o 4.4.1 Finite distinction Discretization
o 4.4.2 Finite aspect Discretization
o 4.4.3 Non-smooth preliminary Data
4.5 Extensions of the Black-Scholes Model
o 4.5.1 CEV Model
o 4.5.2 neighborhood Volatility Models
4.6 extra Reading
American Options
5.1 optimum preventing Problem
5.2 Variational Formulation
5.3 Discretization
o 5.3.1 Finite distinction Discretization
o 5.3.2 Finite point Discretization
5.4 Numerical resolution of Linear Complementarity Problems
o 5.4.1 Projected Successive Overrelaxation Method
o 5.4.2 Primal-Dual lively Set Algorithm
5.5 additional Reading
unique Options
6.1 Barrier Options
6.2 Asian Options
6.3 Compound Options
6.4 Swing Options
6.5 extra Reading
rate of interest Models
7.1 Pricing Equation
7.2 rate of interest Derivatives
7.3 extra Reading
Multi-asset Options
8.1 Pricing Equation
8.2 Variational Formulation
8.3 Localization
8.4 Discretization
o 8.4.1 Finite distinction Discretization
o 8.4.2 Finite aspect Discretization
8.5 additional Reading
Stochastic Volatility Models
9.1 marketplace Models
o 9.1.1 Heston Model
o 9.1.2 Multi-scale Model
9.2 Pricing Equation
9.3 Variational Formulation
9.4 Localization
9.5 Discretization
o 9.5.1 Finite distinction Discretization
o 9.5.2 Finite point Discretization
9.6 American Options
9.7 extra Reading
L�vy Models
10.1 L�vy Processes
10.2 L�vy Models
o 10.2.1 Jump-Diffusion Models
o 10.2.2 natural leap Models
o 10.2.3 Admissible marketplace Models
10.3 Pricing Equation
10.4 Variational Formulation
10.5 Localization
10.6 Discretization
o 10.6.1 Finite distinction Discretization
o 10.6.2 Finite aspect Discretization
10.7 American suggestions lower than Exponential L�vy Models
10.8 extra Reading
Sensitivities and Greeks
11.1 alternative Pricing
11.2 Sensitivity Analysis
o 11.2.1 Sensitivity with appreciate to version Parameters
o 11.2.2 Sensitivity with recognize to answer Arguments
11.3 Numerical Examples
o 11.3.1 One-Dimensional Models
o 11.3.2 Multivariate Models
11.4 extra Reading
Wavelet Methods
12.1 Spline Wavelets
o 12.1.1 Wavelet Transformation
o 12.1.2 Norm Equivalences
12.2 Wavelet Discretization
o 12.2.1 house Discretization
o 12.2.2 Matrix Compression
o 12.2.3 Multilevel Preconditioning
12.3 Discontinuous Galerkin Time Discretization
o 12.3.1 Derivation of the Linear Systems
o 12.3.2 answer Algorithm
12.4 extra Reading

Part II complicated thoughts and Models

Multidimensional Diffusion Models
13.1 Sparse Tensor Product Finite point Spaces
13.2 Sparse Wavelet Discretization
13.3 absolutely Discrete Scheme
13.4 Diffusion Models
o 13.4.1 Aggregated Black-Scholes Models
o 13.4.2 Stochastic Volatility Models
13.5 Numerical Examples
o 13.5.1 Full-Rank d-Dimensional Black-Scholes Model
o 13.5.2 Low-Rank d-Dimensional Black-Scholes
13.6 extra Reading
Multidimensional L�vy Models
14.1 L�vy Processes
14.2 L�vy Copulas
14.3 L�vy Models
o 14.3.1 Subordinated Brownian Motion
o 14.3.2 L�vy Copula Models
o 14.3.3 Admissible Models
14.4 Pricing Equation
14.5 Variational Formulation
14.6 Wavelet Discretization
o 14.6.1 Wavelet Compression
o 14.6.2 absolutely Discrete Scheme
14.7 software: effect of Approximations of Small Jumps
o 14.7.1 Gaussian Approximation
o 14.7.2 Basket Options
o 14.7.3 Barrier Options
14.8 additional Reading
Stochastic Volatility versions with Jumps
15.1 marketplace Models
o 15.1.1 Bates Models
o 15.1.2 BNS Model
15.2 Pricing Equations
15.3 Variational Formulation
15.4 Wavelet Discretization
15.5 extra Reading
Multidimensional Feller Processes
16.1 Pseudodifferential Operators
16.2 Variable Order Sobolev Spaces
16.3 Subordination
16.4 Admissible marketplace Models
16.5 Variational Formulation
o 16.5.1 zone Condition
o 16.5.2 Well-Posedness
16.6 Numerical Examples
16.7 additional Reading

Elliptic Variational Inequalities

Parabolic Variational Inequalities


Show description

Read or Download Computational Methods for Quantitative Finance: Finite Element Methods for Derivative Pricing PDF

Similar number systems books

Numerical Integration on Advanced Computer Systems

This monograph is a finished therapy of the theoretical and computational features of numerical integration. The authors supply a different evaluation of the subject through bringing into line many contemporary examine effects no longer but awarded coherently; the large bibliography lists 268 goods. specific emphasis is given to the aptitude parallelism of numerical integration difficulties and to using it via dynamic load distribution concepts.

Higher-Order Finite Element Methods

The finite point procedure has constantly been a mainstay for fixing engineering difficulties numerically. the newest advancements within the box truly point out that its destiny lies in higher-order tools, rather in higher-order hp-adaptive schemes. those recommendations reply good to the expanding complexity of engineering simulations and fulfill the general development of simultaneous answer of phenomena with a number of scales.

Extra info for Computational Methods for Quantitative Finance: Finite Element Methods for Derivative Pricing

Example text

2 Convergence of the Finite Element Method Assume uniform mesh width h in space and constant time steps k = T /M in time. 7). 5 Assume u ∈ C 1 (J ; H 2 (G)) ∩ C 3 (J ; H −1 (G)). 14), with VN = ST . 30). Then, the following error bound holds: M−1 uM − uM N 2 L2 (G) +k um+θ − um+θ N 2 a m=0 ≤ Ch2 max u(t) 0≤t≤T +C k2 k4 T 0 T 0 H 2 (G) T + Ch2 ∂tt u(s) 2∗ ds ∂ttt u(s) 2∗ ds ∂t u(s) 0 2 ds H 1 (G) if 0 ≤ θ ≤ 1, if θ = 12 . 28) is equivalent to the energy-norm · V . e. first order convergence in the energy norm, provided the solution u(t, x) is sufficiently smooth.

41) L2 (G) . Proof If u ∈ H01 (G), u = u ∈ C 0 (G). Let ξ ∈ G be such that maxx |u(x)| = |u(ξ )|. Then u 2 L∞ (G) ξ = |u(ξ )|2 = |(u(ξ ))2 − (u(0))2 | ≤ u L∞ (G) = (u(η)2 ) dη 0 ξ =2 u(η)u (η) dη ≤ 2 u 0 L2 (G) u L2 (G) . 42) as h → 0. 42) also hold with constants that depend on b − a. If u has better regularity than just u ∈ H 2 (G), better convergence rates are possible. 4 For G = (0, 1), u ∈ W 2,∞ (G) and equidistant mesh width h, one has u − IN u as h → 0. 2 Convergence of the Finite Element Method Assume uniform mesh width h in space and constant time steps k = T /M in time.

10). For this section, we assume the uniform mesh width h in space and constant time steps k = T /M. We define 1 v a := a(v, v) 2 . 28) In the analysis, we will use for f ∈ VN∗ the following notation: f ∗ := sup vN ∈VN (f, vN ) . 29) We will also need λA defined by 2 vN vN λA := sup vN ∈VN 2 ∗ . In the case 12 ≤ θ ≤ 1, the θ -scheme is stable for any time step k > 0, whereas in the case 0 ≤ θ < 12 the time step k must be sufficiently small. 1 In the case 0 ≤ θ < 12 , assume σ := k(1 − 2θ )λA < 2.

Download PDF sample

Rated 4.38 of 5 – based on 10 votes

About the Author