中国科学院数学与系统科学研究院期刊网

03 February 2026, Volume 44 Issue 2
    

  • Select all
    |
  • Jiwei Jia, Lin Yang, Qilong Zhai
    Journal of Computational Mathematics. 2026, 44(2): 307-327. https://doi.org/10.4208/jcm.2411-m2024-0051
    Abstract ( ) Download PDF   Knowledge map   Save
    In this paper, we propose a pressure-robust weak Galerkin (WG) finite element scheme to solve the Stokes-Darcy problem. To construct the pressure-robust numerical scheme, we use the divergence-free velocity reconstruction operator to modify the test function on the right side of the numerical scheme. This numerical scheme is easy to implement because it only need to modify the right side. We prove the error between the velocity function and its numerical solution is independent of the pressure function and viscosity coefficient. Moreover, the errors of the velocity function reach the optimal convergence orders under the energy norm, as validated by both theoretical analysis and numerical results.
  • Chi Zhang, Manabu Machida
    Journal of Computational Mathematics. 2026, 44(2): 328-348. https://doi.org/10.4208/jcm.2411-m2024-0125
    Abstract ( ) Download PDF   Knowledge map   Save
    The Rytov approximation has been commonly used to obtain reconstructed images for optical tomography. However, the method requires linearization of the nonlinear inverse problem. Here, we demonstrate nonlinear Rytov approximations by developing the inverse Rytov series for the time-dependent diffusion equation. The method is verified by a solidphantom experiment.
  • Wanwan Zhu, Guanghua Ji
    Journal of Computational Mathematics. 2026, 44(2): 349-368. https://doi.org/10.4208/jcm.2412-m2024-0126
    Abstract ( ) Download PDF   Knowledge map   Save
    In this paper, we present a posteriori error estimates of the weak Galerkin finite element method for the steady-state Poisson-Nernst-Planck equations. The a posteriori error estimators for the electrostatic potential and ion concentrations are constructed. The reliability and efficiency of the estimators are verified by the upper and lower bounds of the energy norm of the error. The a posteriori error estimators are applied to the adaptive weak Galerkin algorithm for triangle, quadrilateral and polygonal meshes with hanging nodes. Finally, numerical results demonstrate the effectiveness of the adaptive algorithm guided by our constructed estimators.
  • Xiaolong Li, Zhi-Qin John Xu, Zhongwang Zhang
    Journal of Computational Mathematics. 2026, 44(2): 369-393. https://doi.org/10.4208/jcm.2412-m2024-0083
    Abstract ( ) Download PDF   Knowledge map   Save
    In this work, we investigate the mechanism underlying loss spikes observed during neural network training. When the training enters a region with a lower-loss-as-sharper structure, the training becomes unstable, and the loss exponentially increases once the loss landscape is too sharp, resulting in the rapid ascent of the loss spike. The training stabilizes when it finds a flat region. From a frequency perspective, we explain the rapid descent in loss as being primarily influenced by low-frequency components. We observe a deviation in the first eigendirection, which can be reasonably explained by the frequency principle, as low-frequency information is captured rapidly, leading to the rapid descent. Inspired by our analysis of loss spikes, we revisit the link between the maximum eigenvalue of the loss Hessian (λmax), flatness and generalization. We suggest that λmax is a good measure of sharpness but not a good measure for generalization. Furthermore, we experimentally observe that loss spikes can facilitate condensation, causing input weights to evolve towards the same direction. And our experiments show that there is a correlation (similar trend) between λmax and condensation. This observation may provide valuable insights for further theoretical research on the relationship between loss spikes, λmax, and generalization.
  • Long Yuan, Xiaoyu Wang, Xiaoqiang Yue
    Journal of Computational Mathematics. 2026, 44(2): 394-426. https://doi.org/10.4208/jcm.2412-m2024-0141
    Abstract ( ) Download PDF   Knowledge map   Save
    The h-version analysis technique developed in [Banjai et al., SIAM J. Numer. Anal., 55 (2017)] for Trefftz discontinuous Galerkin (DG) discretizations of the second order isotropic wave equation is extended to the time-dependent Maxwell equations in anisotropic media. While the discrete variational formulation and its stability and quasi-optimality are derived parallel to the acoustic wave case, the derivation of error estimates in a mesh-skeleton norm requires new transformation stabilities for the anisotropic case. The error estimates of the approximate solutions with respect to the condition number of the coefficient matrices are proved. Furthermore, we propose the global Trefftz DG method combined with local DG methods to solve the time-dependent nonhomogeneous Maxwell equations. The numerical results verify the validity of the theoretical results, and show that the resulting approximate solutions possess high accuracy.
  • Minxing Zhang, Yongkui Zou
    Journal of Computational Mathematics. 2026, 44(2): 427-445. https://doi.org/10.4208/jcm.2412-m2024-0184
    Abstract ( ) Download PDF   Knowledge map   Save
    The weak convergence analysis plays an important role in error estimates for stochastic differential equations, which concerns with the approximation of the probability distribution of solutions. In this paper, we investigate the weak convergence order of a splitting-up method for stochastic differential equations. We first construct a splitting-up approximation, based on which we also set up a splitting-up numerical solution. We prove both of these two approximation methods are of first order of weak convergence with the help of Malliavin calculus. Finally, we present several numerical experiments to illustrate our theoretical analysis.
  • Bo Song, Jing-Yi Wang, Yao-Lin Jiang
    Journal of Computational Mathematics. 2026, 44(2): 446-478. https://doi.org/10.4208/jcm.2412-m2024-0049
    Abstract ( ) Download PDF   Knowledge map   Save
    Numerical simulation of time-periodic problems is a special area of research, since the time periodicity modifies the problem structure, and then it is desirable to use parallel methods to solve such problems. The classical parareal algorithm for time-periodic problems, which is parallel in time, solving an initial value coarse problem, called the periodic parareal algorithm with initial value coarse problem (PP-IC), usually converges very slowly, and even diverges for wave propagation problems. In this paper, we first present a new PP-IC algorithm based on a diagonalization technique proposed recently. In this new algorithm, we approximate the coarse propagator G in the classical PP-IC algorithm with a head-tail coupled condition such that G can be parallelized using diagonalization in time. We analyze the convergence factors of the diagonalization-based PP-IC algorithm for both the linear and nonlinear cases. Then, we further design and analyze a new parallel-intime algorithm for time-periodic problems by combining the Krylov subspace method with the diagonalization-based PP-IC algorithm to accelerate the convergence. Finally, we also determine an appropriate choice of the parameter α in the head-tail coupling condition, and illustrate our theoretical results with several numerical experiments, both for model problems and the realistic application of Maxwell’s equations.
  • Yang Xu, Zhenguo Zhou, Jingjun Zhao
    Journal of Computational Mathematics. 2026, 44(2): 479-520. https://doi.org/10.4208/jcm.2502-m2024-0134
    Abstract ( ) Download PDF   Knowledge map   Save
    The rigorous error analysis of a class of serendipity virtual element methods applied to numerically solve semilinear parabolic integro-differential equations on curved domains is the focus of this study. Different from the standard virtual element method, the serendipity virtual element method eliminates all the internal-moment degrees of freedom only under certain conditions of the mesh and the degree of approximation. Consequently, if the interpolation operators are utilized to approximate the nonlinear terms, the implementation of Newton’s iteration algorithm can be simplified. Nonhomogeneous Dirichlet boundary conditions are considered in this paper. The strategy of approximating curved domains with polygonal domains is taken into consideration, and to overcome the issue of suboptimal convergence caused by enforcing Dirichlet boundary conditions strongly, Nitsche-based projection method is employed to impose the boundary conditions weakly. For time discretization, Crank-Nicolson scheme incorporating trapezoidal quadrature rule is adopted. Based on the concrete formulation of Nitsche-based projection method, a Ritz-Volterra projection is introduced and its approximation properties are rigorously analyzed. Building upon these approximation properties, error estimates are derived for the fully discrete scheme. Additionally, the extension of the fully discrete scheme to 3D case is also included. Finally, we present two numerical experiments to corroborate the theoretical findings.
  • Yanping Chen, Zhenrong Chen, Yanping Zhou, Fangfang Qin
    Journal of Computational Mathematics. 2026, 44(2): 521-538. https://doi.org/10.4208/jcm.2502-m2024-0208
    Abstract ( ) Download PDF   Knowledge map   Save
    In this paper, we present a generalized Jacobi spectral Galerkin method for fractional Volterra integro-differential equations (FVIDEs). The basis functions of the proposed method are generalized Jacobi functions, which serve as natural basis functions for appropriately designed spectral methods for FVIDEs. We establish a convergence analysis of the generalized Jacobi spectral Galerkin method under reasonable assumptions. Numerical experiments are provided to demonstrate the effectiveness of the proposed method.
  • Hegagi Mohamed Ali
    Journal of Computational Mathematics. 2026, 44(2): 539-563. https://doi.org/10.4208/jcm.2502-m2024-0035
    Abstract ( ) Download PDF   Knowledge map   Save
    In this research article, we present convenient analytical-approximate solutions for fluid flow models known as multi-dimensional Navier-Stokes equations containing time-fractional order by using a relatively new analytical method called modified generalized MittagLeffler function method. The Caputo fractional derivative is used to describe fractional mathematical formalism. The approximate solutions for five problems are implemented to demonstrate the validity and accuracy of the proposed method. It is also demonstrated that the solutions obtained from our method when α = 1 coincide with the exact solutions, this is displayed by using some 2D and 3D plots for each problem. Moreover, the comparison between our outcomes with given exact solutions and results obtained by other methods in the literature besides absolute error is provided in some tables. Additionally, we offer some plots when α has different values to present the effect of fractional order on the solution of each suggested problem. The numerical simulation presented in this work indicates that the proposed method is efficient, reliable, accurate and easy which has less computational ability to give analytical-approximate solution form. So, this method can be extended to implement on different related problems arising in various areas of innovation and research.
  • Liangwei Hong, Xin Li
    Journal of Computational Mathematics. 2026, 44(2): 564-577. https://doi.org/10.4208/jcm.2502-m2024-0179
    Abstract ( ) Download PDF   Knowledge map   Save
    Achieving linear complexity is crucial for demonstrating optimal convergence rates in adaptive refinement. It has been shown that the existing linear complexity local refinement algorithm for T-splines generally produces more degrees of freedom than the existing greedy refinement, which lacks linear complexity. This paper introduces a novel greedy local refinement algorithm for analysis-suitable T-splines, which achieves linear complexity and requires fewer control points than existing algorithms with linear complexity. Our approach is based on the observation that confining refinements around each T-junction to a preestablished feasible region ensures the algorithm’s linear complexity. Building on this constraint, we propose a greedy optimization local refinement algorithm that upholds linear complexity while significantly reducing the degrees of freedom relative to previous linear complexity local refinement methods.
  • Lijuan Peng, Lihang Zhou, Wenqiang Wang
    Journal of Computational Mathematics. 2026, 44(2): 578-592. https://doi.org/10.4208/jcm.2509-m2025-0023
    Abstract ( ) Download PDF   Knowledge map   Save
    In this paper, a numerical method for solving nonlinear stochastic delay differential equations is proposed: two-step Milstein method. The mean square consistent and mean square convergence of the numerical method are studied. Through the relevant derivation, the conditions that the coefficients need to be satisfied when the numerical method is mean-square consistent and mean-square convergent are obtained, and it is proved that the mean-square convergence order of the numerical method is 1. Finally, the theoretical results are verified by numerical experiments.