2014
DOI: 10.1016/j.camwa.2014.01.018
|View full text |Cite
|
Sign up to set email alerts
|

Stabilized explicit Runge–Kutta methods for multi-asset American options

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 35 publications
(19 citation statements)
references
References 43 publications
0
19
0
Order By: Relevance
“…Some stabilized explicit Runge-Kutta algorithms (SERK) were derived in [25,26,29,30]. They are also based on three-term recurrence formulae.…”
Section: Extrapolated Explicit Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Some stabilized explicit Runge-Kutta algorithms (SERK) were derived in [25,26,29,30]. They are also based on three-term recurrence formulae.…”
Section: Extrapolated Explicit Methodsmentioning
confidence: 99%
“…These types of problems are common in a large amount of applications such as atmospheric phenomena, biology, chemistry, combustion problems, financial mathematics, fluid mechanics, industrial engineering, laser modelling, malware propagation, medicine, molecular dynamics, nuclear kinetics, etc., see [3,6,12,13,14,15,17,20,30,43], to mention a few.…”
Section: Introductionmentioning
confidence: 99%
“…We note that the SERK scheme is also limited in stage number, requiring 600 digits of precision for 320 stages, albeit principally due to severely ill-conditioned matrix systems used in calculating the stability polynomials by means of the Remez algorithm [18]. A subsequent revision of the SERK methodology has demonstrated a stability range which is four times larger [36].…”
Section: Internal Stabilitymentioning
confidence: 99%
“…The three asset American-put option under the Black-Scholes model [26] is considered as a free boundary-value problem and can be written as [27] ∂U ∂t…”
Section: Introductionmentioning
confidence: 99%