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

15 November 2025, Volume 43 Issue 6
    

  • Select all
    |
  • Mingze Qin, Hui Peng, Qilong Zhai
    Journal of Computational Mathematics. 2025, 43(6): 1349-1373. https://doi.org/10.4208/jcm.2404-m2023-0232
    Abstract ( ) Download PDF   Knowledge map   Save
    In this paper, we introduce the weak Galerkin (WG) method for solving the coupled Stokes and Darcy-Forchheimer flows problem with the Beavers-Joseph-Saffman interface condition in bounded domains. We define the WG spaces in the polygonal meshes and construct corresponding discrete schemes. We prove the existence and uniqueness of the WG scheme by the discrete inf-sup condition and monotone operator theory. Then, we derive the optimal error estimates for the velocity and pressure. Numerical experiments are presented to verify the efficiency of the WG method.
  • Guozhi Dong, Hailong Guo, Ting Guo
    Journal of Computational Mathematics. 2025, 43(6): 1374-1396. https://doi.org/10.4208/jcm.2404-m2023-0245
    Abstract ( ) Download PDF   Knowledge map   Save
    Superconvergence of differential structure on discretized surfaces is studied in this paper. The newly introduced geometric supercloseness provides us with a fundamental tool to prove the superconvergence of gradient recovery on deviated surfaces. An algorithmic framework for gradient recovery without exact geometric information is introduced. Several numerical examples are documented to validate the theoretical results.
  • Huadong Gao, Wen Xie
    Journal of Computational Mathematics. 2025, 43(6): 1397-1416. https://doi.org/10.4208/jcm.2404-m2023-0189
    Abstract ( ) Download PDF   Knowledge map   Save
    This paper is concerned with the new error analysis of a Hodge-decomposition based finite element method for the time-dependent Ginzburg-Landau equations in superconductivity. In this approach, the original equation of magnetic potential A is replaced by a new system consisting of four scalar variables. As a result, the conventional Lagrange finite element method (FEM) can be applied to problems defined on non-smooth domains. It is known that due to the low regularity of A, conventional FEM, if applied to the original Ginzburg-Landau system directly, may converge to the unphysical solution. The main purpose of this paper is to establish an optimal error estimate for the order parameter in spatial direction, as previous analysis only gave a sub-optimal convergence rate analysis for all three variables due to coupling of variables. The analysis is based on a nonstandard quasi-projection for ψ and the corresponding negative-norm estimate for the classical Ritz projection. Our numerical experiments confirm the optimal convergence of ψh.
  • Xin Liu, Zhangxin Chen
    Journal of Computational Mathematics. 2025, 43(6): 1417-1443. https://doi.org/10.4208/jcm.2404-m2023-0150
    Abstract ( ) Download PDF   Knowledge map   Save
    In this paper, we develop a fully discrete virtual element scheme based on the local pressure projection stabilization for a three-field poroelasticity problem with a storage coefficient c0 ≥ 0. We not only provide the well-posedness of the proposed scheme by proving a weaker form of the discrete inf-sup condition, but also show optimal error estimates for all unknowns, whose generic constants are independent of the Lamé coefficient λ. Moreover, our proposed scheme avoids pressure oscillation and applies to general polygonal elements, including hanging-node elements. Finally, we numerically validate the good performance of our virtual element scheme.
  • Jun Hu, Rui Ma, Yuanxun Sun
    Journal of Computational Mathematics. 2025, 43(6): 1444-1468. https://doi.org/10.4208/jcm.2405-m2023-0051
    Abstract ( ) Download PDF   Knowledge map   Save
    This paper constructs the first mixed finite element for the linear elasticity problem in 3D using P3 polynomials for the stress and discontinuous P2 polynomials for the displacement on tetrahedral meshes under some mild mesh conditions. The degrees of freedom of the stress space as well as the corresponding nodal basis are established by characterizing a space of certain piecewise constant symmetric matrices on a patch around each edge. Macro-element techniques are used to define a stable interpolation to prove the discrete inf-sup condition. Optimal convergence is obtained theoretically.
  • Yuhao Wang, Weiying Zheng
    Journal of Computational Mathematics. 2025, 43(6): 1469-1487. https://doi.org/10.4208/jcm.2510-m2025-0072
    Abstract ( ) Download PDF   Knowledge map   Save
    This paper presents a simple proof for the stability of circular perfectly matched layer (PML) methods for solving acoustic scattering problems in two and three dimensions. The medium function of PML allows arbitrary-order polynomials, and can be extended to general nondecreasing functions with a slight modification of the proof. In the regime of high wavenumbers, the inf-sup constant for the PML truncated problem is shown to be $\mathcal{O}$(k-1). Moreover, the PML solution converges to the exact solution exponentially, with a wavenumber-explicit rate, as either the thickness or medium property of PML increases. Numerical experiments are presented to verify the theories and performances of PML for variant polynomial degrees.
  • Jongho Park, Jinchao Xu, Xiaofeng Xu
    Journal of Computational Mathematics. 2025, 43(6): 1488-1511. https://doi.org/10.4208/jcm.2406-m2023-0143
    Abstract ( ) Download PDF   Knowledge map   Save
    In this paper, we propose a novel algorithm called neuron-wise parallel subspace correction method for the finite neuron method that approximates numerical solutions of partial differential equations (PDEs) using neural network functions. Despite extremely extensive research activities in applying neural networks for numerical PDEs, there is still a serious lack of effective training algorithms that can achieve adequate accuracy, even for one-dimensional problems. Based on recent results on the spectral properties of linear layers and analysis for single neuron problems, we develop a special type of subspace correction method that optimizes the linear layer and each neuron in the nonlinear layer separately. An optimal preconditioner that resolves the ill-conditioning of the linear layer is presented for one-dimensional problems, so that the linear layer is trained in a uniform number of iterations with respect to the number of neurons. In each single neuron problem, a local minimum is found by a superlinearly convergent algorithm. Numerical experiments on function approximation problems and PDEs demonstrate better performance of the proposed method than other gradient-based methods.
  • S. Amat, S. Busquier, J. A. Ezquerro, M. A. Hernández-Verón, N. Romero
    Journal of Computational Mathematics. 2025, 43(6): 1512-1523. https://doi.org/10.4208/jcm.2406-m2024-0017
    Abstract ( ) Download PDF   Knowledge map   Save
    The aim of this paper is to present an improvement of the incremental Newton method proposed by Iannazzo [SIAM J. Matrix Anal. Appl., 28:2 (2006), 503–523] for approximating the principal p-th root of a matrix. We construct and analyze an incremental Chebyshev method with better numerical behavior. We present a convergence and numerical analysis of the method, where we compare it with the corresponding incremental Newton method. The new method has order of convergence three and is stable and more efficient than the incremental Newton method.
  • Yalan Zhang, Pengzhan Huang, Yinnian He
    Journal of Computational Mathematics. 2025, 43(6): 1524-1547. https://doi.org/10.4208/jcm.2407-m2023-0108
    Abstract ( ) Download PDF   Knowledge map   Save
    In this work, an unconditionally stable, decoupled, variable time step scheme is presented for the incompressible Navier-Stokes equations. Based on a scalar auxiliary variable in exponential function, this fully discrete scheme combines the backward Euler scheme for temporal discretization with variable time step and a mixed finite element method for spatial discretization, where the nonlinear term is treated explicitly. Moreover, without any restriction on the time step, stability of the proposed scheme is discussed. Besides, error estimate is provided. Finally, some numerical results are presented to illustrate the performances of the considered numerical scheme.
  • Huaijun Yang, Dongyang Shi
    Journal of Computational Mathematics. 2025, 43(6): 1548-1574. https://doi.org/10.4208/jcm.2406-m2023-0169
    Abstract ( ) Download PDF   Knowledge map   Save
    This paper is concerned with the superconvergence error estimates of a classical mixed finite element method for a nonlinear parabolic/elliptic coupled thermistor equations. The method is based on a popular combination of the lowest-order rectangular Raviart-Thomas mixed approximation for the electric potential/field (φ, θ) and the bilinear Lagrange approximation for temperature u. In terms of the special properties of these elements above, the superclose error estimates with order $\mathcal{O}$(h2) are obtained firstly for all three components in such a strongly coupled system. Subsequently, the global superconvergence error estimates with order $mathcal{O}$(h2) are derived through a simple and effective interpolation post-processing technique. As by a product, optimal error estimates are acquired for potential/field and temperature in the order of $mathcal{O}$(h) and $mathcal{O}$(h2), respectively. Finally, some numerical results are provided to confirm the theoretical analysis.
  • Kangkang Deng, Jiang Hu, Hongxia Wang
    Journal of Computational Mathematics. 2025, 43(6): 1575-1603. https://doi.org/10.4208/jcm.2407-m2023-0282
    Abstract ( ) Download PDF   Knowledge map   Save
    We study decentralized smooth optimization problems over compact submanifolds. Recasting it as a composite optimization problem, we propose a decentralized DouglasRachford splitting algorithm (DDRS). When the proximal operator of the local loss function does not have a closed-form solution, an inexact version of DDRS (iDDRS), is also presented. Both algorithms rely on careful integration of the nonconvex Douglas-Rachford splitting algorithm with gradient tracking and manifold optimization. We show that our DDRS and iDDRS achieve the convergence rate of $\mathcal{O}$(1/k). The main challenge in the proof is how to handle the nonconvexity of the manifold constraint. To address this issue, we utilize the concept of proximal smoothness for compact submanifolds. This ensures that the projection onto the submanifold exhibits convexity-like properties, which allows us to control the consensus error across agents. Numerical experiments on the principal component analysis are conducted to demonstrate the effectiveness of our decentralized DRS compared with the state-of-the-art ones.
  • Begoña Cano, María Jesús Moreta
    Journal of Computational Mathematics. 2025, 43(6): 1604-1620. https://doi.org/10.4208/jcm.2407-m2023-0131
    Abstract ( ) Download PDF   Knowledge map   Save
    In a previous paper, a technique was suggested to avoid order reduction with any explicit exponential Runge-Kutta method when integrating initial boundary value nonlinear problems with time-dependent boundary conditions. In this paper, we significantly simplify the full discretization formulas to be applied under conditions which are nearly always satisfied in practice. Not only a simpler linear combination of $\varphi_j$-functions is given for both the stages and the solution, but also the information required on the boundary is so much simplified that, in order to get local order three, it is no longer necessary to resort to numerical differentiation in space. In many cases, even to get local order 4. The technique is then shown to be computationally competitive against other widely used methods with high enough stiff order through the standard method of lines.