Searcharxiv⌕ Search

arXiv · 2610.25780

Convergence of alternating score-system iterations for regularized Landau particle dynamics

Abstract

We analyze an alternating iteration for score-based particle approximations of the homogeneous Landau equation. Each step computes a regularized score along the previous trajectory and recomputes the trajectory with that score frozen. First, at fixed positive regularization, we prove existence, uniqueness, and $W_1$-Lipschitz stability of a Tikhonov score minimizer in a vector-valued reproducing kernel Hilbert space embedded in $C_b^2$. For bounded Lipschitz collision matrices, this yields factorial convergence to the coupled regularized dynamics on every finite interval, with constants independent of particle number. Global objective gaps and system residuals control inexact solves, and structural kernel assumptions ensure momentum and energy conservation. The mean-field and alternating-iteration limits commute at fixed regularization in this regime. Second, score-difference cancellation extends the theory to far-field-truncated Landau kernels with $γ\geq -2$ and the uncut case $γ=-2$. For the uncut three-dimensional Coulomb kernel, a separate continuum construction gives local factorial convergence from bounded, compactly supported densities. Third, we characterize the obstruction to removing regularization at fixed particle number and establish a separate conditional density-level convergence criterion under uniform regularity and approximation assumptions, using relative entropy. A heat-equation counterexample shows that an unregularized density-level Picard iteration can diverge. Atomic Coulomb and simultaneous particle-zero-regularization limits remain open.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yeoneung Kim, Donghyun Lee, Sung-Jun Son. 2026-10-19. Convergence of alternating score-system iterations for regularized Landau particle dynamics. https://arxiv.org/abs/2610.25780

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↗