2018
DOI: 10.1553/etna_vol47s57
|View full text |Cite
|
Sign up to set email alerts
|

Incremental computation of block triangular matrix exponentials with application to option pricing

Abstract: We study the problem of computing the matrix exponential of a block triangular matrix in a peculiar way: Block column by block column, from left to right. The need for such an evaluation scheme arises naturally in the context of option pricing in polynomial diffusion models. In this setting a discretization process produces a sequence of nested block triangular matrices, and their exponentials are to be computed at each stage, until a dynamically evaluated criterion allows to stop. Our algorithm is based on sc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…Once the blocks of U θ are known, the exponential θ (x) is efficiently evaluated from (3.4) using the block triangular structure of U θ (see e.g. Kressner et al [14]).…”
Section: Ruin Time and Probability Of Ruinmentioning
confidence: 99%
“…Once the blocks of U θ are known, the exponential θ (x) is efficiently evaluated from (3.4) using the block triangular structure of U θ (see e.g. Kressner et al [14]).…”
Section: Ruin Time and Probability Of Ruinmentioning
confidence: 99%
“…Once the blocks of U θ are known, the blocks of its exponential Φ θ pxq can be computed efficiently using the special structure of U θ by following for instance Kressner et al [14] where the authors propose an efficient incremental procedure to compute the (blocktriangular) square matrix constituted by the first n block lines and columns of e U θ x , from the (previously obtained) square matrix constituted by the first n ´1 block lines and columns of e U θ x . Particular case where A k " A and D k " D for all k ě 1.…”
Section: 11)mentioning
confidence: 99%
“…As long as the square roots in (18) are positive the Euler-Maruyama scheme is well-defined. In our numerical experiments this was the case.…”
Section: Call Option In Stochastic Volatility Modelsmentioning
confidence: 99%
“…Finally, G n is the matrix representation of the action of the generator of (V t , X t ) restricted to the space Pol n (R 2 ). Note that the matrix G n can be constructed as explained in [18], with respect to the monomial basis.…”
Section: Call Option In Stochastic Volatility Modelsmentioning
confidence: 99%