数值分析
In this paper, we develop an efficient preconditioned unfitted finite element method for the elliptic interface problem, based on the reconstructed discontinuous approximation. The approximation method for interface problems is originally…
The reliable and accurate numerical approximation of the $p$-Laplacian is particularly challenging in the extreme regimes $p \to 1^{+}$ and $p \gg 1$, where the operator becomes either highly singular or strongly degenerate, often causing…
Krylov subspace methods, such as the Conjugate Gradient (CG) and BiCGSTAB methods, are widely used in scientific computing for solving linear systems. In this study, we propose a new framework for solving large Sylvester equations in a…
The parareal algorithm is a powerful parallel-in-time integration method that accelerates the numerical solution of evolution equations by iteratively combining a fine propagator and a coarse propagator. Although the convergence of the…
The Virtual Element Method (VEM) is a well-established framework for solving partial differential equations on polygonal and polyhedral meshes. In this paper, we introduce a novel hybrid VEM that integrates both conforming and nonconforming…
This paper introduces a novel, robust, and computationally efficient framework for high-quality quadrilateral mesh generation on general two-dimensional domains. The core of the proposed approach is a novel method for computing cross fields…
In this paper, we propose a spectral framework that embeds 1D and 2D quasiperiodic Helmholtz eigenvalue problems into higher-dimensional (2D and 4D) periodic spaces via the projection method \cite{jiang2014numerical, jiang2024numerical}. To…
We develop a structure-preserving computational framework for acoustic wave scattering by moving objects, comprising a new PML-domain-embedding model and a compatible numerical approximation. The model couples a perfectly matched layer…
Let $ \chi $ be a character of a complex irreducible representation of a finite group $G$. We present a simple formula for the expectation of the random variable $(|\chi|/\chi(1))^{t} $ in terms of character ratios $…
We present a dynamical low-rank (DLR) method for the Vlasov-Poisson-Fokker-Planck (VPFP) system. Our main contributions are two-fold: (i) a conservative spatial discretization of the Fokker-Planck operator that factors into velocity-only…
Solving large tensor linear systems poses significant challenges due to the high volume of data stored, and it only becomes more challenging when some of the data is missing. Recently, Ma et al. showed that this problem can be tackled using…
Efficient large-scale network allocation requires data-driven pricing mechanisms that internalize the stochastic and non-linear dynamics of user behavior. We move beyond the classic fully strategic agents to study oblivious users (agents…
In this paper, we introduce a new semi-discrete modulus of smoothness, which generalizes the definition given by Kolomoitsev and Lomako (KL) in 2023 (in the paper published in the J. Approx. Theory), and we establish very general one- and…
Natural Gradient Descent (NGD) has emerged as a promising optimization algorithm for training neural network-based solvers for partial differential equations (PDEs), such as Physics-Informed Neural Networks (PINNs). However, its practical…
We establish optimal convergence rates for the continuous piecewise affine finite element approximation of the Sobolev constant in arbitrary dimensions N\geq 2 and for Lebesgue exponents 1<p<N. Our analysis relies on a refined study of the…
In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $\Phi$,…
An efficient coarse-mesh nodal integral method (NIM), based on cell-centered variables and termed the cell-centered NIM (CCNIM), is developed and applied to solve multi-dimensional, time-dependent, nonlinear Burgers equations, extending the…
In this paper we study consensus-based optimization (CBO), a versatile, flexible and customizable optimization method suitable for performing nonconvex and nonsmooth global optimizations in high dimensions. CBO is a multi-particle…
A spectral collocation operator with the summation-by-parts property was introduced by Chan to develop entropy-stable discontinuous Galerkin (DG) semi-discretizations (https://doi.org/10.1016/j.jcp.2018.02.033). The present work shows that…
We present new convergence estimates for the iterated penalty method applied to structure-preserving discretizations of linear generalized saddle point systems. The method may be viewed as an Uzawa iteration on an augmented Lagrangian…