We propose numerical schemes for the approximate solution of problems defined on the edges of a one-dimensional graph. In particular, we consider linear transport and a drift-diffusion equations, and discretize them by extending finite volume schemes with upwind flux to domains presenting bifurcation nodes with an arbitrary number of incoming and outgoing edges, and implicit time discretization. We show that the discrete problems admit positive unique solutions, and we test the methods on the intricate geometry of electrical treeing.

A monotone finite volume scheme for linear drift-diffusion and pure drift equations on one-dimensional graphs

Crippa, Beatrice;Scotti, Anna;Villa, Andrea;
2025-01-01

Abstract

We propose numerical schemes for the approximate solution of problems defined on the edges of a one-dimensional graph. In particular, we consider linear transport and a drift-diffusion equations, and discretize them by extending finite volume schemes with upwind flux to domains presenting bifurcation nodes with an arbitrary number of incoming and outgoing edges, and implicit time discretization. We show that the discrete problems admit positive unique solutions, and we test the methods on the intricate geometry of electrical treeing.
2025
drift-diffusion equations
electrical treeing
one-dimensional graphs
transport equations
upwind finite volumes
File in questo prodotto:
File Dimensione Formato  
10.3934_nhm.2025029.pdf

Accesso riservato

Dimensione 3.11 MB
Formato Adobe PDF
3.11 MB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/1300956
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact