Discrete advection–diffusion equations on graphs: Maximum principle and finite volumes

Radim Hošek and Jonáš Volek

Applied Mathematics and Computation, 2019, vol. 361, issue C, 630-644

Abstract: We study an initial value problem for explicit and implicit difference advection–diffusion equations on graphs. Problems on both finite and infinite graphs are considered. We analyze the existence and uniqueness of solutions. Interestingly, we show that there exist infinitely many solutions to implicit problems on infinite graphs similarly as in the case of continuous or lattice diffusion equations on infinite spatial domains. The main part of the paper is devoted to maximum principles. Firstly, we establish discrete maximum principles for equations on graphs. Then we show that finite volume numerical schemes for advection–diffusion PDEs in any dimension can be reformulated as equations on graphs and consequently, we use this relation to verify maximum principles for corresponding numerical solutions.

Keywords: Advection–diffusion equation; Difference equation; Graph; Maximum principle; Finite volume method; Equivolumetric mesh (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319304795
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:361:y:2019:i:c:p:630-644

DOI: 10.1016/j.amc.2019.06.014

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().