mlsanityData to 14 Oct 2026

Structure-Oriented Randomized Neural Networks for Poisson-Nernst-Planck and Poisson-Nernst-Planck-Navier-Stokes Systems

arXiv 2606.19912 ↗First posted 18 Jun 2026math.NA cs.LG cs.NAcited by 0

Not on the map. Why?

Abstract (arXiv)

We develop a structure-oriented randomized neural network framework, termed SO-RaNN, for the Poisson-Nernst-Planck (PNP) system and the Poisson-Nernst-Planck-Navier-Stokes (PNP-NS) system. The decoupled linearized subproblems are solved iteratively by randomized neural networks in a space-time framework. For the concentration variables, a pointwise cut-off is used to enforce positivity at the value level, and discrete mass-scaling factors are computed at selected correction instants and interpolated in time, so as to ensure exact mass matching at those instants and to promote approximate mass preservation between them. To introduce an auxiliary discrete dissipation mechanism, we further employ an SAV-type post-processing correction, which yields monotonicity of the SAV auxiliary variable under the ideal SAV update. For the PNP-NS system, a structure-preserving randomized neural network (SP-RaNN) is used for the velocity field, so that the velocity approximation satisfies the incompressibility constraint pointwise by construction. On the theoretical side, we derive residual-based estimates for the raw, uncorrected RaNN solvers of the linearized subproblems, formulate a conditional local-in-time convergence result for the raw outer Picard iteration of the PNP system, and analyze the value-level positivity correction together with the mass-correction and SAV post-processing steps. For the PNP-NS system, we establish an approximation result for the SP-RaNN space and provide a conditional error statement for the corresponding linearized Oseen-type problem. Numerical experiments demonstrate approximation accuracy in the source-driven manufactured tests and illustrate the intended value-level positivity correction, selected-time mass matching, computed free-energy curves based on the final gauge-fixed potential, and divergence-free approximation in benchmark tests.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 55 references that are in the map. First posted on arXiv 18 Jun 2026.

Builds on

11 of 55 references.

References · 11

  1. 2017DGM: A deep learning algorithm for solving partial differential equationscited by 678
  2. 2019DeepXDE: A deep learning library for solving differential equationscited by 619
  3. 2017The Deep Ritz method: A deep learning-based numerical algorithm for solving variational problemscited by 583
  4. 2021Finite Basis Physics-Informed Neural Networks (FBPINNs): a scalable domain decomposition approach for solving differential equationscited by 145
  5. 2020Local Extreme Learning Machines and Domain Decomposition for Solving Linear and Nonlinear Partial Differential Equationscited by 81
  6. 2020PFNN: A Penalty-Free Neural Network Method for Solving a Class of Second-Order Boundary-Value Problems on Complex Geometriescited by 38
  7. 2023An Extreme Learning Machine-Based Method for Computational PDEs in Higher Dimensionscited by 21
  8. 2022A Method for Computing Inverse Parametric PDE Problems with Random-Weight Neural Networkscited by 14
  9. 2023TransNet: Transferable Neural Networks for Partial Differential Equationscited by 13
  10. 2026Adaptive-Distribution Randomized Neural Networks for PDEs: A Low-Dimensional Distribution-Learning Frameworkcited by 2
  11. 2026Structure-preserving Randomized Neural Networks for Incompressible Magnetohydrodynamics Equationscited by 1

Built on by

Not cited yet.