Search arXiv⌕ Search

arXiv · 2610.25569

A Reduced-Order Model for the High-Field Vlasov-Poisson-Fokker-Planck System Based on a Micro-Macro Decomposition

Abstract

We develop a projection-based reduced-order model for the high-field Vlasov-Poisson-Fokker-Planck system. Based on a micro-macro decomposition, the proposed Micro-ROM applies proper orthogonal decomposition (POD)-Galerkin reduction only to the microscopic fluctuation while retaining the macroscopic density on the full spatial grid. The field-dependent Maxwellian and collision operator introduce additional computational costs that cannot be eliminated by Galerkin projection alone. To remove the dependence on the velocity-grid resolution during online simulations, we approximate the projected Maxwellian terms using precomputed Chebyshev expansions of functions of the local electric field and exploit a separable discretization of the collision operator to assemble the reduced collision matrix exactly from precomputed blocks. A first-order implicit-explicit scheme is employed to evolve the reduced coefficients and the density. The resulting method conserves discrete mass and formally recovers a discretization of the limiting high-field model as $\varepsilon\rightarrow 0$. Its online computational cost per time step is independent of the velocity-grid resolution. Numerical experiments demonstrate the accuracy and efficiency of the proposed method across a range of parameters, including the high-field regime.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shiheng Zhang, Jingwei Hu. 2026-10-18. A Reduced-Order Model for the High-Field Vlasov-Poisson-Fokker-Planck System Based on a Micro-Macro Decomposition. https://arxiv.org/abs/2610.25569

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↗