2018
DOI: 10.48550/arxiv.1812.08324
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Efficient Numerical Method for Models Driven by Lévy Process via Hierarchical Matrices

Kailai Xu,
Eric Darve

Abstract: Modeling via fractional partial differential equations or a Lévy process has been an active area of research and has many applications. However, the lack of efficient numerical computation methods for general nonlocal operators impedes people from adopting such modeling tools. We proposed an efficient solver for the convection-diffusion equation whose operator is the infinitesimal generator of a Lévy process based on H-matrix technique. The proposed Crank Nicolson scheme is unconditionally stable and has a the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 39 publications
0
2
0
Order By: Relevance
“…In Section 8, we see that one may extract computationally efficient compactly supported models providing sparse discrete operators that accurately approximate fractional operators with infinite horizons. This is particularly promising as a means of deriving preconditioners and O(n) solvers for fractional systems, as naive discretizations provide dense matrices which require complex hierarchical preconditioners to solve efficiently [62][63][64]…”
Section: Discussionmentioning
confidence: 99%
“…In Section 8, we see that one may extract computationally efficient compactly supported models providing sparse discrete operators that accurately approximate fractional operators with infinite horizons. This is particularly promising as a means of deriving preconditioners and O(n) solvers for fractional systems, as naive discretizations provide dense matrices which require complex hierarchical preconditioners to solve efficiently [62][63][64]…”
Section: Discussionmentioning
confidence: 99%
“…In this case, discretization results in dense and unstructured matrices, and hence the storage complexity will be O(N 2 ) whereas the computational complexity will be O(N 3 ). One promising strategy for efficiently solving the nonlocal problem (11.1) with unstructured meshes is to apply hierarchical matrices so that only linear storage and computational complexity are required; see (Xu and Darve 2018a).…”
Section: Quadrature-rule Based Finite Difference Methodsmentioning
confidence: 99%