Search arXiv⌕ Search

arXiv · 1601.00813

Exponential decay of a finite volume scheme to the thermal equilibrium for drift--diffusion systems

Abstract

In this paper, we study the large--time behavior of a numerical scheme discretizing drift-- diffusion systems for semiconductors. The numerical method is finite volume in space, implicit in time, and the numerical fluxes are a generalization of the classical Scharfetter-- Gummel scheme which allows to consider both linear or nonlinear pressure laws. We study the convergence of approximate solutions towards an approximation of the thermal equilibrium state as time tends to infinity, and obtain a decay rate by controlling the discrete relative entropy with the entropy production. This result is proved under assumptions of existence and uniform-in-time $L $\infty$$ estimates for numerical solutions, which are then discussed. We conclude by presenting some numerical illustrations of the stated results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marianne Bessemoulin-Chatard, Claire Chainais-Hillairet. 2018-08-31. Exponential decay of a finite volume scheme to the thermal equilibrium for drift--diffusion systems. https://doi.org/10.1515/jnma-2016-0007

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perturbed saddle-point problems in $\mathrm{L}^p$ with non-regular loads

In this work, we develop the continuous and discrete solvability analysis for perturbed saddle-point problems in Banach spaces with forcing terms regularised by means of a projector constructed using the adjoint of a weighted Clément quasi-interpolation. We take as driving example the linearised Poisson--Boltzmann equation (an advection-diffusion-reaction problem) in mixed form. We use perturbation arguments on the continuous and discrete levels and then derive a priori estimates that remain valid when the load that appears on the right-hand side of the "second" equation is in $\mathrm{H}^{-1}$. Further, we show a supercloseness result and {analyse convergence} of an adequate adaptation of Stenberg postprocessing for mixed advection equations with non-regular data. We provide numerical results that illustrate the convergence of the proposed scheme.

math.NA↗

Born-Preconditioned Learning for Iterative Neural PDE Solvers

Simulating high-frequency waves in spatially varying media remains challenging for both classical iterative methods and neural PDE solvers. We propose Neural Preconditioned Born Series (NPBS), a framework for learning iterative neural PDE solvers. Our guiding idea is to use a simple reference preconditioner to help learn a more effective neural preconditioner. Building on the Convergent Born Series (CBS), NPBS feeds a preconditioned residual to a neural network that predicts a solution update. We train the network to reduce the preconditioned residual after each update. The same reference preconditioner is used for the network input and the loss, giving a metric-matched training objective. Experiments on heterogeneous Helmholtz problems show reduced iteration counts across neural architectures and larger gains at higher wavenumbers. Within a Krylov solver, NPBS achieves the lowest wall-clock time in the evaluated solver comparison. The framework also extends naturally to three-dimensional problems. The same metric-matched formulation also improves convergence on convection-diffusion-reaction systems and Newton linear systems for nonlinear PDEs, indicating that NPBS provides a general framework for learning neural preconditioners.

math.NA↗

Flexible GMRES converges in two phases

We derive a sharp upper bound on the residuals produced by the flexible GMRES (FGMRES) method. The bound shows that FGMRES exhibits two phases of convergence depending on the residual tolerance of the inner preconditioner. For small tolerances, the convergence of FGMRES is practically geometric with a constant rate throughout, while for looser tolerances the two-phase behavior becomes more pronounced. We also show that the derived bound cannot be improved and construct an example for which it becomes an equality.

math.NA↗