Searcharxiv⌕ Search

arXiv subjects

Pingbing Ming

Publications and source records attributed to Pingbing Ming.

At least 19 recordsLinked to original sources

First Order Convergence of Representative Volume Element with Mixed Boundary Condition

We study the cell problem with mixed Dirichlet-Neumann boundary condition to reconstruct the effective matrix for two-dimensional scalar divergence-form equations with bounded measurable, and possibly nonsymmetric coefficients. We prove uniform invertibility of the mean-gradient matrix. Moreover, we derive the first-order error estimate when the medium is periodic.

math.NA↗

Universal Approximation by Equivariant Message-Passing Graph Neural Networks with a Bilinear Readout

We prove universal approximation for the bilinear-readout equivariant message-passing network (BREMP), a reference architecture for equivariant graph neural network interatomic potentials. Its layers combine equivariant convolutions with affine maps, and its readout forms invariants from products of the equivariant features. We construct a one-layer feature that determines the local environment up to permutations of atoms of the same type. The construction uses spherical harmonic filters of degree no larger than the largest number of neighbors at a common distance from the center. Iterating the construction recovers the environment reachable in as many hops as there are layers, using the same bound on filter degrees at the layer cutoff. The readout approximates every continuous invariant function of the features uniformly on compact sets. Together these give universal approximation of atomic energies at a prescribed physical range using a shorter layer cutoff. We assume that, throughout the admissible class, message passing reaches all neighbors in each physical environment within a common number of layers. Finally, DPA4, an interatomic potential architecture in production use, inherits this result by approximating the BREMP layers constructed in the proof and realizing the bilinear readout.

cs.LG↗

The Scott-Vogelius element is inf-sup stable on Freudenthal meshes for $k \geq 4$

The Scott-Vogelius element is a classical divergence-free mixed finite element for the Stokes problem that has attracted decades of research attention, yet its theoretical framework remains incomplete. In two dimensions, the inf-sup stability on Freudenthal and other regular meshes has been rigorously established. In three dimensions, Zhang established inf-sup stability on Freudenthal meshes for $k\ge6$ in 2011, while numerical evidence indicates that inf-sup stability remains true for $k=4,5$. In this paper, we strengthen Zhang's approach and prove that the Scott--Vogelius element is inf-sup stable on Freudenthal meshes for every velocity degree $k\ge 4$, thereby resolving a conjecture proposed by Farrell, Mitchell, and Scott in 2024. The proof proceeds by explicit constructions on local patches and does not rely on computer verification.

math.NA↗

Spectral Convergence of Random Feature Method in Multiple Dimensions

We first prove spectral convergence of the random feature method (RFM) for multidimensional targets in Sobolev, Gevrey, ultra-analytic, and bandlimited classes. The analysis establishes general high-probability approximation estimates in the interpolation scale generated by a kernel integral operator. On a single event determined only by the sampled features, one random space approximates every target in a prescribed source ball; moreover, for each target, a single coefficient vector defines an approximant that attains spectral accuracy simultaneously in all admissible error norms. For both regularity-adapted frequency distributions and uniform distributions on growing frequency windows, the resulting rates range from super-exponential to algebraic, depending on the regularity of the target. Second, we establish abstract error estimates for strong- and weak-form RFM discretizations, thereby converting the preceding approximation bounds into convergence estimates for multidimensional second-order elliptic boundary value and eigenvalue problems. Finally, for random feature matrices (RFMtxs), we prove super-exponential singular-value decay with Fourier features and exponential decay with $\tanh$ features, together with corresponding condition-number lower bounds. The analysis identifies a common mechanism: the same spectral approximation that yields high accuracy also drives severe ill-conditioning.

math.NA↗

Why Multi-Layer Message Passing Works: Completeness Theory for Graph Neural Network Interatomic Potentials

We prove that the Hypergraph Neural Network, an invariant architecture with 3-body message passing, is a universal approximator for potential energy surfaces. Our main contribution is a multi-layer completeness theory. We show that $L$ layers of message passing on sparse, cutoff-based graphs achieve the same representational power as having access to the full $L$-hop neighborhood, provided the configurations are generic, satisfy an overlap condition and a connectivity condition. This provides the first rigorous justification for the common practice of using multi-layer message passing with a per-layer cutoff smaller than the physical interaction range, the setting used by virtually all practical graph neural network based machine-learned interatomic potentials. As immediate consequences, we show that both DPA3 and CHGNet architectures inherit universal approximation.

cs.LG↗

Sharp Mixed Spectral Barron Regularity of Coulombic Many-Electron Wave Functions

We establish sharp mixed spectral Barron regularity for eigenfunctions of molecular Coulomb Hamiltonians. The mixed norm is a Fourier $L^1$ norm with one isotropic weight and coordinate-product weights, and therefore detects regularity invisible to the isotropic Barron scale. For a nonempty set $I$ of electron indices on which the wave function is antisymmetric, we derive an explicit admissible region for the isotropic order $s$ and the coordinate orders $α,β$. This region is optimal as a uniform statement over the class of clamped-nuclei Coulomb Hamiltonians. For fixed-spin components with two occupied spin blocks, it reduces to $s+α+β<1$; in the fully spin-polarized class it reduces to $s+α<1$. In particular, if $\mathcal I_σ$ denotes the family of occupied same-spin blocks determined by $σ$, then every fixed-spin spatial component $ψ_σ$ satisfies, for every $0\leqα<1$, \[ \left(\sum_{I\in\mathcal I_σ}\prod_{i\in I}\langleξ_i\rangle^α\right)\widehat{ψ_σ}\in L^1(\mathbb{R}^{3N}). \] For a fully spin-polarized state, $\mathcal I_σ=\{\{1,\ldots,N\}\}$.

math.AP↗

Spectral convergence of random feature method in one dimension

We first prove the spectral convergence of the random feature method (RFM) when used to solve second-order elliptic equations and eigenvalue problems in one dimension, provided that the solutions belong to Gevrey classes or Sobolev spaces. Second, we derive the convergence rate of RFM when integrated with the Partition of Unity Method (PUM) in terms of the patch size. Finally, we show that the singular values of the resulting random feature matrix decay exponentially, leading to exponential growth of the condition number. We also prove that PUM can mitigate this excessive singular-value decay.

math.NA↗

Sharp Barron Regularity Results for Coulombic Many-Electron Wave Functions

We establish sharp Barron regularity for Coulombic many-electron wave functions after extraction of the universal cut-off Jastrow factors. Following the factorization of Fournais et al.~\cite[Definition~1.4]{FournaisEtAl2005}, for a Coulombic eigenfunction $ψ$ we define the successive quotients by \[ ϕ=e^{-F_{2,\mathrm{cut}}}ψ\quad\text{and}\quad ϕ_3=e^{-F_{3,\mathrm{cut}}}ϕ=e^{-(F_{2,\mathrm{cut}}+F_{3,\mathrm{cut}})}ψ. \] Then \[ ϕ,ϕ_3\in\mathcal{B}^s(\mathbb{R}^{3N}) \qquad\text{for every }s<2. \] This range is optimal among universal factorizations. No factor depending only on the particle number and the nuclear data, but not on the eigenfunction or its eigenvalue, can make every corresponding quotient belong to $\mathcal{B}^2$. We also determine the exact endpoint growth. Writing $\varepsilon=2-s$, we prove that, for either $u=ϕ$ or $u=ϕ_3$, there is a computable constant $M$ independent of $\varepsilon$ such that \[ \left\|u\right\|_{\mathcal{B}^{2-\varepsilon}}\leq\frac{M}{\varepsilon^2}\left\|u\right\|_{\mathcal{B}^1}. \] For the unperturbed two-electron atom we prove, with a constant independent of $\varepsilon$, \[ \left|\left\|ϕ_3\right\|_{\mathcal{B}^{2-\varepsilon}}-\frac{32πZ\lvertϕ_3(0,0)\rvert}{\varepsilon^2}\right|\leq\frac{C}{\varepsilon}. \] Hence the quadratic rate in the upper bound is sharp whenever $\lvertϕ_3(0,0)\rvert\neq0$, as is the case for the ground state.

math.AP↗

A concurrent global-local numerical method for multiscale parabolic equations

This paper presents a concurrent global-local numerical method for solving multiscale parabolic equations in divergence form. The proposed method employs hybrid coefficient to provide accurate macroscopic information while preserving essential microscopic details within specified local defects. Both the macroscopic and microscopic errors have been improved compared to existing results, eliminating the factor of $Δt^{-1/2}$ when the diffusion coefficient is time-independent. Numerical experiments demonstrate that the proposed method effectively captures both global and local solution behaviors.

math.NA↗

Barron regularity of many particle Schrödinger eigenfunctions

This work investigates the regularity of Schrödinger eigenfunctions and the solvability of Schrödinger equations in spectral Barron space $\mathcal{B}^{s}(\mathbb{R}^{nN})$, where neural networks exhibit dimension-free approximation capabilities. Under assumptions that the potential $V$ consists of one-particle and pairwise interaction parts $V_{i},V_{ij}$ in Fourier-Lebesgue space $\mathcal{F}L_{s}^{1}(\mathbb{R}^{n})+\mathcal{F}L_{s}^{α^{\prime}}(\mathbb{R}^{n})$ and an additional part $V_{\operatorname{a d}} \in \mathcal{F}L_{s}^{1}(\mathbb{R}^{nN})$, we prove that all eigenfunctions $ψ\in \bigcap_{γ 0$. The assumption accommodates many prevalent singular potentials, such as inverse power potentials. Moreover, under the same assumption or a stronger assumption $V\in\mathcal{B}^{s}(\mathbb{R}^{nN})$, we establish the solvability of Schrödinger equations and derive compactness results for $V\in\mathcal{B}^{s}(\mathbb{R}^{nN})$ with $s>-1$.

math.AP↗

Sharp uniform approximation for spectral Barron functions by deep neural networks

This work explores the neural network approximation capabilities for functions within the spectral Barron space $\mathscr{B}^s$, where $s$ is the smoothness index. We demonstrate that for functions in $\mathscr{B}^{1/2}$, a shallow neural network (a single hidden layer) with $N$ units can achieve an $L^p$-approximation rate of $\mathcal{O}(N^{-1/2})$. This rate also applies to uniform approximation, differing by at most a logarithmic factor. Our results significantly reduce the smoothness requirement compared to existing theory, which necessitate functions to belong to $\mathscr{B}^1$ in order to attain the same rate. Furthermore, we show that increasing the network's depth can notably improve the approximation order for functions with small smoothness. Specifically, for networks with $L$ hidden layers, functions in $\mathscr{B}^s$ with $0 < sL \le 1/2$ can achieve an approximation rate of $\mathcal{O}(N^{-sL})$. The rates and prefactors in our estimates are dimension-free. We also confirm the sharpness of our findings, with the lower bound closely aligning with the upper, with a discrepancy of at most one logarithmic factor.

math.NA↗

A broken Hardy inequality on finite element space and application to strain gradient elasticity

We illustrate a broken Hardy inequality on discontinuous finite element spaces, blowing up with a logarithmic factor with respect to the meshes size. This is motivated by numerical analysis for the strain gradient elasticity with natural boundary conditions. A mixed finite element pair is employed to solve this model with nearly incompressible materials. This pair is quasi-stable with a logarithmic factor, which is not significant in the approximation error, and converges robustly in the incompressible limit and uniformly in the microscopic material parameter. Numerical results back up that the theoretical predictions are nearly optimal. Moreover, the regularity estimates for the model over a smooth domain have been proved with the aid of the Agmon-Douglis-Nirenberg theory.

math.NA↗

Heterogeneous multiscale methods for fourth-order singular perturbations

We develop a numerical homogenization method for fourth-order singular perturbation problems within the framework of heterogeneous multiscale method. These problems arise from heterogeneous strain gradient elasticity and elasticity models for architectured materials. We establish an error estimate for the homogenized solution applicable to general media and derive an explicit convergence for the locally periodic media with the fine-scale $\varepsilon$. For cell problems of size $δ=\mathbb{N}\varepsilon$, the classical resonance error $\mathcal{O}(\varepsilon/δ)$ can be eliminated due to the dominance of the higher-order operator. Despite the occurrence of boundary layer effects, discretization errors do not necessarily deteriorate for general boundary conditions. Numerical simulations corroborate these theoretical findings.

math.NA↗

Spectral Barron space for deep neural network approximation

We prove the sharp embedding between the spectral Barron space and the Besov space with embedding constants independent of the input dimension. Given the spectral Barron space as the target function space, we prove a dimension-free convergence result that if the neural network contains $L$ hidden layers with $N$ units per layer, then the upper and lower bounds of the $L^2$-approximation error are $\mathcal{O}(N^{-sL})$ with $0 < sL\le 1/2$, where $s\ge 0$ is the smoothness index of the spectral Barron space.

math.NA↗

The TRUNC element in any dimension and application to a modified Poisson equation

We introduce a novel TRUNC finite element in n dimensions, encompassing the traditional TRUNC triangle as a particular instance. By establishing the weak continuity identity, we identify it as crucial for error estimate. This element is utilized to approximate a modified Poisson equation defined on a convex polytope, originating from the nonlocal electrostatics model. We have substantiated a uniform error estimate and conducted numerical tests on both the smooth solution and the solution with a sharp boundary layer, which align with the theoretical predictions.

math.NA↗

Generalization Error Estimates of Machine Learning Methods for Solving High Dimensional Schrödinger Eigenvalue Problems

We propose a machine learning method for computing eigenvalues and eigenfunctions of the Schrödinger operator on a $d$-dimensional hypercube with Dirichlet boundary conditions. The cut-off function technique is employed to construct trial functions that precisely satisfy the homogeneous boundary conditions. This approach eliminates the error caused by the standard boundary penalty method, improves the overall accuracy of the method, as demonstrated by the typical numerical examples. Under the assumption that the eigenfunctions belong to a spectral Barron space, we derive an explicit convergence rate of the generalization error of the proposed method, which does not suffer from the curse of dimensionality. We verify the assumption by proving a new regularity shift result for the eigenfunctions when the potential function belongs to an appropriate spectral Barron space. Moreover, we extend the generalization error bound to the normalized penalty method, which is widely used in practice.

math.NA↗

A pre-training deep learning method for simulating the large bending deformation of bilayer plates

We propose a deep learning based method for simulating the large bending deformation of bilayer plates. Inspired by the greedy algorithm, we propose a pre-training method on a series of nested domains, which accelerate the convergence of training and find the absolute minimizer more effectively. The proposed method exhibits the capability to converge to an absolute minimizer, overcoming the limitation of gradient flow methods getting trapped in the local minimizer basins. We showcase better performance with fewer numbers of degrees of freedom for the relative energy errors and relative $L^2$-errors of the minimizer through numerical experiments. Furthermore, our method successfully maintains the $L^2$-norm of the isometric constraint, leading to an improvement of accuracy.

math.NA↗

Error Estimate of Multiscale Finite Element Method for Periodic Media Revisited

We derive the optimal energy error estimate for multiscale finite element method with oversampling technique applying to elliptic system with rapidly oscillating periodic coefficients under the assumption that the coefficients are bounded and measurable, which may admit rough microstructures. As a by-product of the energy estimate, we derive the rate of convergence in L$^{d/(d-1)}-$norm.

math.NA↗