Peimeng Yin

NA
h-index16
4papers
3citations
Novelty46%
AI Score42

4 Papers

NAMay 22, 2019
General superpositions of Gaussian beams and propagation errors

Hailiang Liu, James Ralston, Peimeng Yin

Gaussian beams are asymptotically valid high frequency solutions concentrated on a single curve through the physical domain, and superposition of Gaussian beams provides a powerful tool to generate more general high frequency solutions to PDEs. We present a superposition of Gaussian beams over an arbitrary bounded set of dimension $m$ in phase space, and show that the tools recently developed in [ H. Liu, O. Runborg, and N. M. Tanushev, Math. Comp., 82: 919--952, 2013] can be applied to obtain the propagation error of order $k^{1- \frac{N}{2}- \frac{d-m}{4}}$, where $N$ is the order of beams and $d$ is the spatial dimension. Moreover, we study the sharpness of this estimate in examples.

81.5NAApr 23
Unconditional energy stable hybrid IEQ-FEMs for the Cahn-Hilliard-Navier-Stokes equations

Yaoyao Chen, Dongqian Li, Yin Yang et al.

We investigate two unconditionally energy stable invariant energy quadratization (IEQ) finite element methods (FEMs) [Chen et al. Numerical Algorithms, DOI: 10.1007/s11075-024-01910-z, 2024] for solving the Cahn-Hilliard-Navier-Stokes (CHNS) equations. The time discretization of these IEQ-FEMs is based on the first- and second-order backward differentiation methods. \textcolor{black}{The auxiliary energy function introduced by the IEQ approach, modeling the square root of the nonlinear part of the energy, does not belong to the finite element space used for the spatial discretization.} These methods offer distinct advantages. Consequently, we propose a new hybrid IEQ-FEM that combines the strengths of both schemes, offering computational efficiency and unconditional energy stability in the finite element space. We provide rigorous proofs of mass conservation and energy dissipation for the proposed IEQ-FEMs. Several numerical experiments are presented to validate the accuracy, efficiency, and solution properties of the proposed method.

74.4NAMar 23
A fully decoupled and structure-preserving relaxation Crank--Nicolson finite element method for Gross--Pitaevskii--Poisson model

Dongqian Li, Huini Liu, Yin Yang et al.

We propose a fully decoupled, structure-preserving relaxation Crank--Nicolson finite element method (FEM) for the coupled Gross--Pitaevskii--Poisson (GPP) system modeling ultracold plasmas. By introducing suitable auxiliary variables to reformulate the nonlinear interaction and charge density terms, the original system is recast into an equivalent form that enables a linear, fully decoupled numerical scheme. The proposed method preserves key physical invariants, including the mass of each component and a modified discrete energy, at the fully discrete level. We establish the well-posedness and uniqueness of the scheme and rigorously derive optimal error estimates, achieving second-order accuracy in time and optimal $(k+1)$-th order convergence in space for $P^k$ finite element approximations. Numerical experiments confirm the theoretical results and demonstrate the effectiveness of the method in preserving conservation properties and accurately capturing complex dynamical behaviors of the coupled GPP system.

LGOct 9, 2025
Weights initialization of neural networks for function approximation

Xinwen Hu, Yunqing Huang, Nianyu Yi et al.

Neural network-based function approximation plays a pivotal role in the advancement of scientific computing and machine learning. Yet, training such models faces several challenges: (i) each target function often requires training a new model from scratch; (ii) performance is highly sensitive to architectural and hyperparameter choices; and (iii) models frequently generalize poorly beyond the training domain. To overcome these challenges, we propose a reusable initialization framework based on basis function pretraining. In this approach, basis neural networks are first trained to approximate families of polynomials on a reference domain. Their learned parameters are then used to initialize networks for more complex target functions. To enhance adaptability across arbitrary domains, we further introduce a domain mapping mechanism that transforms inputs into the reference domain, thereby preserving structural correspondence with the pretrained models. Extensive numerical experiments in one- and two-dimensional settings demonstrate substantial improvements in training efficiency, generalization, and model transferability, highlighting the promise of initialization-based strategies for scalable and modular neural function approximation. The full code is made publicly available on Gitee.