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

14 August 2026, Volume 48 Issue 3
    

  • Select all
    |
    Reviews and Perspectives
  • Yuan Yaxiang
    Mathematica Numerica Sinica. 2026, 48(3): 395-404. https://doi.org/10.12286/jssx.j2026-1387
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The gradient method is one of the simplest and most fundamental computational methods for solving optimization problems. Since all gradient methods find the next iterate along the steepest descent direction, the difference among various gradient methods lies in the choice of step size. The BB step size is one of the most renowned choices for step size in gradient methods. In this paper, by interpreting the BB step as a step size based on onedimensional subspace approximation, we construct new step sizes based on two-dimensional and three-dimensional subspace approximations. These new step sizes possess favorable theoretical properties and are expected to be developed into effective numerical methods.
  • Articles
  • Li Mengyu, Liu Tiegang, Feng Chengliang
    Mathematica Numerica Sinica. 2026, 48(3): 405-426. https://doi.org/10.12286/jssx.j2025-1332
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In singularly perturbed ODE-constrained optimization problems, the existence of the nonhomogeneous term increases the difficulty of derivative discretization in the objective function, thereby increasing the difficulty of solving the optimization problem. In this paper, we propose an exponential-type scheme, denoted as ETS-NHE, for discretizing the derivative in the objective function, specifically designed for three classes of singularly perturbed ODEconstrained optimization problems with nonhomogeneous terms. Theoretical analysis and numerical experiments can verify the effectiveness of ETS-NHE and ensure convergence of the optimized numerical solution to the correct solution.
  • Zhou Fengying, Liu Wenying
    Mathematica Numerica Sinica. 2026, 48(3): 427-445. https://doi.org/10.12286/jssx.j2024-1268
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A numerical technique for solving fractional-order differential equations based on the seventh-kind Chebyshev wavelets is established. Firstly, the construction of seventh-kind Chebyshev wavelets is based on the corresponding seventh-kind Chebyshev polynomials. The convergence analysis and error estimation of functions expanded in terms of these wavelets are derived by evaluating the coefficients associated with the seventh-kind Chebyshev wavelets. Additionally, we further explore fractional seventh-kind Chebyshev wavelets. Subsequently, we derive the fractional integration formulas for fractional seventh-kind Chebyshev wavelets within the framework of Riemann-Liouville fractional integration using both unit step function and Beta function. By employing these fractional integration formulas alongside an effective collocation method, we discretize the fractional-order differential equation into a system of algebraic equations, from which we obtain the numerical solution to the problem by using Newton iteration method. Several numerical examples demonstrate both the effectiveness and high accuracy of this proposed numerical method.
  • Wang Jue, Zhu Yulu
    Mathematica Numerica Sinica. 2026, 48(3): 446-461. https://doi.org/10.12286/jssx.j2025-1310
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the biharmonic wave equation, this paper studies the technique of constructing control fields with active sources by combining potential theory and numerical methods. First, the integral representation for the biharmonic wave equation are derived by using potential theory. Furthermore, by studying the distribution of active sources on the boundary, the control field satisfying the biharmonic wavefield is constructed and applied to the problem of achieving illusion effects. This paper constructs approximate control fields by using numerical methods. In numerical experiments, the goal of wavefield control with a small number of low-order active sources is achieved.
  • Zhang Ying, Wang Zhen, Li Gongsheng
    Mathematica Numerica Sinica. 2026, 48(3): 462-476. https://doi.org/10.12286/jssx.j2025-1315
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This article deals with asymptotic solution and inversion of fractional order in the fractional SIR epidemic model. The asymptotic solution to the model is derived by the ADM method, and an optimal computable expression of the asymptotic solution is obtained by numerical analysis. Based on the asymptotic solution with an observation of the recovered people at a given time, the inverse order problem is transformed to an algebraic equation, and its uniqueness is obtained by monotonicity of the nonlinear function of the order. Numerical inversions with noisy data are performed to support the uniqueness of the inverse order problem. Parameters identification and data reconstruction are performed by utilizing real data of COVID-19, indicating that fractional-order models have certain advantages in describing complex dynamical epidemiology systems.
  • Wang Sijie, Zhao Yongliang, Gu Xianming
    Mathematica Numerica Sinica. 2026, 48(3): 477-492. https://doi.org/10.12286/jssx.j2025-1335
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The Cahn-Hilliard (CH) is an important fourth-order diffusion equation. It was originally used to study the physical phenomenon of mutual diffusion between substances. At the same time, it also has important applications in the evolution of biological populations, riverbed migration, and the field of chemistry. This paper intends to combine the advantages of the low computational cost of the adaptive low-rank splitting method and some fast solving techniques to study the adaptive low-rank approximation algorithm of the CH equation. Firstly, we use the finite difference method to discretize the space of the CH equation and split it into a linear subproblem and a nonlinear subproblem, thereby obtaining a full-rank splitting scheme. Based on this split formulation, we propose an adaptive low-rank solution algorithm for the CH equation in combination with a dynamical low-rank method. Finally, we provide several examples to test the effectiveness of the proposed algorithm in this paper.
  • Zou Lu, Li Rui, Lei Yuan
    Mathematica Numerica Sinica. 2026, 48(3): 493-514. https://doi.org/10.12286/jssx.j2025-1339
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The eigenvalue complementarity problem, as an important branch of linear and nonlinear complementarity problems, holds significant theoretical value and application prospects in fields such as optimization theory, numerical algebra, and engineering mechanics. This paper investigates the generalized quadratic eigenvalue complementarity problem (QEiCP)J defined on the nonnegative cone, establishing sufficient conditions for the existence of its solutions and providing an upper bound estimate for the number of solutions. Within the framework of the semismooth Newton method, three numerical iteration schemes based on the Fischer-Burmeister complementarity function are designed, and the convergence theory for the algorithms is presented. Numerical experiments conducted on various test examples validate the effectiveness of the proposed methods. The results demonstrate that the semismooth Newton algorithm based on the penalized Fischer-Burmeister function exhibits superior performance, particularly for large-scale dense matrix problems, and shows good adaptability and numerical stability in practical tests such as those from the Matrix Market. Furthermore, the algorithm exhibits strong robustness with respect to the choice of the penalty parameter, effectively balancing computational efficiency and accuracy.
  • Zhang Zehan, Li Hong
    Mathematica Numerica Sinica. 2026, 48(3): 515-531. https://doi.org/10.12286/jssx.j2025-1341
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A novel hybrid algorithm, termed the finite element method-enhanced neural network (FEM-NN), is proposed for the convection-diffusion equations. In contrast to physicsinformed neural networks (PINNs), in which a large number of collocation points are required for loss minimization, only a small set of mesh nodes is utilized in the proposed method. The finite element stiffness matrix and load vector are incorporated into the loss function of a feedforward neural network, and new FEM-NN algorithms are constructed for both steady-state and unsteady-state problems. For the steady-state case, the hyperbolic tangent function is employed as the activation function, while for the unsteady case, the residuals are derived from the discretized backward Euler scheme, and the loss function is formulated by combining boundary and initial conditions with the residuals, the SiLU and GELU functions are adopted as activation functions, meanwhile, FEM solutions and FEMNN solutions are compared through numerical experiments. It is demonstrated that the FEM-NN algorithm is capable of accurately reconstructing the FEM solution in the steadystate regime, while higher accuracy and stronger generalization capability are exhibited in the unsteady regime. The method proposed in this paper integrates the physical consistency and data-driven adaptability, and it provides a novel numerical approach for convection-diffusion type partial differential equations.
  • Yu Wenxin, Wei Yifan, Shan Yuqing, Niu Jing
    Mathematica Numerica Sinica. 2026, 48(3): 532-551. https://doi.org/10.12286/jssx.j2025-1342
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents an efficient numerical method based on the quasi-Newton method and the reproducing kernel method for solving nonlinear singularly perturbed delay differential equations. Firstly, the original problem is decomposed into a regular region problem and a boundary layer problem. Secondly, the regular region problem is solved using the asymptotic expansion method; for the boundary layer problem, the problem interval is first mapped to [0, 1] by means of the variable stretching method. Thirdly, the nonlinear singularly perturbed delay differential equation is converted into a series of linear singularly perturbed delay differential equations via the quasi-Newton method. Lastly, solved using the reproducing kernel method based on the collocation method. Meanwhile, this paper discusses the convergence and stability of the proposed method, and compares the numerical results with those of other numerical methods. The results show that the proposed method can not only provide more accurate approximate solutions but also achieve higher convergence orders.
  • Yu Tianhui, Long Xianjun
    Mathematica Numerica Sinica. 2026, 48(3): 552-564. https://doi.org/10.12286/jssx.j2025-1351
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Stochastic gradient descent algorithm is one of effective algorithms for solving stochastic optimization problems and has received extensive attention from many scholars in recent years. However, selecting an appropriate step size for such algorithms remains a critical area of research. In this paper, we propose a novel adaptive stochastic gradient descent algorithm tailored for stochastic convex optimization problems. Notably, the adaptive step size sequence proposed in this paper is bounded and convergent. Under the assumption of strong convexity, we prove that the sequence generated by the algorithm converges linearly to a neighborhood of the optimal value point. Finally, numerical experiments demonstrate the effectiveness and superiority of the new algorithm.