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

14 June 2025, Volume 46 Issue 2
    

  • Select all
    |
  • Liu Kaiquan, Han Deren
    Journal on Numerica Methods and Computer Applications. 2025, 46(2): 85-94. https://doi.org/10.12288/szjs.s2024-0942
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Projection algorithms play an important role in tackling large-scale constrained optimization problems, especially when the orthogonal projection onto the constraint set is easy to implement. In projection algorithms, the choice of step size greatly affects the convergence rates. However, theoretically “optimal” step sizes often have poor effects in practical scenarios. Existing literature has demonstrated that relaxing the optimal step size for unconstrained optimization can achieve acceleration for steepest descent algorithm. Building on this insight, our work extends these relaxation strategies to projection algorithms, including both the fundamental scheme and the “prediction-correction” type, specifically for constrained convex quadratic optimization problems. Our numerical experiments indicate that these relaxation strategies significantly enhance the performance of both types of projection algorithms with optimal step sizes, demonstrating advantages across various problem sizes.
  • Wang Yanfei, Wen Xixiang
    Journal on Numerica Methods and Computer Applications. 2025, 46(2): 95-115. https://doi.org/10.12288/szjs.s2024-0957
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The study of inverse problems has demonstrated significant value and broad application prospects across multiple domains. However, inverse problems in geophysics remain highly challenging due to their inherent complexity and uncertainty. In recent years, the rapid development and application of quantum computing technologies have opened new avenues for addressing this difficult problem. Based on the two currently prominent paradigms of quantum computing, this paper first introduces an iterative inversion algorithm based on quantum annealing. This algorithm integrates the global search capabilities of quantum annealing with the local optimization characteristics of iterative inversion. Through both linear and nonlinear tomography experiments, the proposed algorithm achieves inversion accuracy comparable to that of classical methods. In addition, this paper explores the potential of variational quantum linear system algorithm in solving inverse problems. We introduce a preliminary attempt using this algorithm in solving inverse problems, demonstrating promising application prospects by constructing and optimizing quantum circuits tailored for these challenges. The research presented in this paper provides new ideas and directions for the application of quantum computing in solving inverse problems in geophysics. With the continuous development and application of quantum computing technology, it is expected that quantum computing methods will play a significant role in solving large-scale geophysical inverse problems in the future.
  • Zhou Chengcheng
    Journal on Numerica Methods and Computer Applications. 2025, 46(2): 116-126. https://doi.org/10.12288/szjs.s2024-0970
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    With the development of computer science and information technology, computerized symbolic computation provides a more powerful approach in complex calculations and numerical simulation. Describing the nonlinear mechanism of shallow water wave, one type of (2 + 1)-dimensional generalized variable-coefficient shallow wave equation is investigated in this paper. With the Hirota bilinear method, bilinear form, soliton solutions, bilinear Bäacklund transformation and lump solution are derived and solved. The nonlinear mechanism of shallow water waves described by the soliton solution and lump solution are both illustrated with numerical simulations. One different and novel characteristics of the special solution to the (2 + 1)-dimensional generalized variable-coefficient shallow wave equation is that the lumps move along the y-axis with zero velocity in the x-axis direction.
  • Li Yang, Wang Sheng, Li Menghan, Zhang Zhao
    Journal on Numerica Methods and Computer Applications. 2025, 46(2): 127-137. https://doi.org/10.12288/szjs.s2024-0972
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Geological parameters in petroleum reservoirs are highly heterogeneous, but the exploration approaches are very limited. In consequnce, geological models are usually highly uncertain. No matter conventional history matching or data space inversion, it is necessary to predict future reservoir dynamics under the uncertainty of geological models. This is conventionally done by reservoir simulation. Yet, for the large ensemble of realisattions to reflect the uncertainty of geological models, reservoir simulation is computaionally expensive. For this problem, we extend dynamic mode decomposition (DMD) to the parameter space, and conduct prediction based on a series of geological realisations reflecting the uncertainty of formation parameters. The change of reservoir flow variables tend to become gradual over time. Therefore, we build training and testing data sets, and determine the time after which the dynamic data approximately satisfies local linearity. Then DMD can be used to conduct prediction as a surrogate for reservoir simulation, in order to enhance the efficiency of prediction. The new method is validated using single and two-phase transient Darcy flow test cases.
  • Sun Yuanhang, Jiang Quan, Zhou Zhidong
    Journal on Numerica Methods and Computer Applications. 2025, 46(2): 138-147. https://doi.org/10.12288/szjs.s2024-0973
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    An algorithm for ill-conditioned linear equations is proposed based on the support vector machine (SVM). The ill-conditioned linear equations are transformed to the regression problems for the hyper-plane in high dimensional space. And it can be solved by classic SVM and Least squares SVM (LS-SVM). Compared to the other methods of neural networks, SVM can obtain the numerical solutions with global and unique solution by small errors, since that it is convex quadratic programming algorithm. Numerical examples show that the presented method can achieve numerical solutions with relative high accuracy and stability.
  • Jin Qianggui, Ma Yaohui
    Journal on Numerica Methods and Computer Applications. 2025, 46(2): 148-164. https://doi.org/10.12288/szjs.s2024-0980
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    As the SPD stiffness equation’s scale expands, the memory requirements for direct solver constantly increase. Utilizing abundant hard disk resources to assist in reducing memory demand has become a solution. Three out-of-core(OOC) solving strategies using block supernode Cholesky method are proposed. 1) Fastest OOC strategy ensures that each supernode is read and saved once; 2) Minimum memory OOC strategy ensures that except for supernodes that still need to participate in factorization, all other supernodes are freed; 3) Restricted memory OOC strategy decides whether to adopt strategy 1) or 2) based on the given memory size. Each strategy uses OpenMP to implement asynchronous parallelism based on task pool in a shared memory environment. MUMPS failed to solve a 4984362 dimensional stiffness equation with OOC mode, while the solver using strategy 1) successfully solved with 2328.07s and only 18.2GB memory, saving 87% of 142.85GB memory required for IC solving; PARDISO OOC took 4643.18s and used 21.3GB memory.