项辕重轭苦耕荒──记都昌县大树乡罗岭小学残疾教师罗延龄

项辕重轭苦耕荒──记都昌县大树乡罗岭小学残疾教师罗延龄汪国山，黄春晖“你是一条默默吐丝的春蚕，为人舍命心甘愿”；“你是一棵暗添秋色的小草，装点关山任风雨”；“你是一头腿残志坚的黄牛，项辕重轭苦耕荒”……这一行行滚烫的诗句，情也浓浓，意也浓浓，正是罗老...

An Adaptive Spectral Conjugate Gradient Method with Restart Strategy

As a generalization of the two-term conjugate gradient method(CGM),the spectral CGM is one of the effective methods for solving unconstrained optimization.In this paper,we enhance the JJSL conjugate parameter,initially proposed by Jiang et al.(Computational and Applied Mathematics,2021,40:174),through the utilization of a convex combination technique.And this improvement allows for an adaptive search direction by integrating a newly constructed spectral gradient-type restart strategy.Then,we develop a new spectral CGM by employing an inexact line search to determine the step size.With the application of the weak Wolfe line search,we establish the sufficient descent property of the proposed search direction.Moreover,under general assumptions,including the employment of the strong Wolfe line search for step size calculation,we demonstrate the global convergence of our new algorithm.Finally,the given unconstrained optimization test results show that the new algorithm is effective.

Multi-scale seismic full waveform inversion in the frequency-domain with a multi-grid method

Although full waveform inversion in the frequency domain can overcome the local minima problem in the time direction, such problem still exists in the space direction because of the media subsurface complexity. Based on the optimal steep descent methods, we present an algorithm which combines the preconditioned bi-conjugated gradient stable method and the multi-grid method to compute the wave propagation and the gradient space. The multiple scale prosperity of the waveform inversion and the multi-grid method can overcome the inverse problems local minima defect and accelerate convergence. The local inhomogeneous three-hole model simulated results and the Marmousi model certify the algorithm effectiveness.

写给方志工作者

默默地在梦里飘拂,青丝从羊肠小道飘拂过来,记忆深处,仍有缕缕幽香,温馨着每一个平淡日子.

Improved preconditioned conjugate gradient algorithm and application in 3D inversion of gravity-gradiometry data

With the continuous development of full tensor gradiometer （FTG） measurement techniques, three-dimensional （3D） inversion of FTG data is becoming increasingly used in oil and gas exploration. In the fast processing and interpretation of large-scale high-precision data, the use of the graphics processing unit process unit （GPU） and preconditioning methods are very important in the data inversion. In this paper, an improved preconditioned conjugate gradient algorithm is proposed by combining the symmetric successive over-relaxation （SSOR） technique and the incomplete Choleksy decomposition conjugate gradient algorithm （ICCG）. Since preparing the preconditioner requires extra time, a parallel implement based on GPU is proposed. The improved method is then applied in the inversion of noise- contaminated synthetic data to prove its adaptability in the inversion of 3D FTG data. Results show that the parallel SSOR-ICCG algorithm based on NVIDIA Tesla C2050 GPU achieves a speedup of approximately 25 times that of a serial program using a 2.0 GHz Central Processing Unit （CPU）. Real airbome gravity-gradiometry data from Vinton salt dome （south- west Louisiana, USA） are also considered. Good results are obtained, which verifies the efficiency and feasibility of the proposed parallel method in fast inversion of 3D FTG data.

Global Convergence of a New Restarting Conjugate Gradient Method for Nonlinear Optimizations

Conjugate gradient optimization algorithms depend on the search directions with different choices for the parameters in the search directions. In this note, by combining the nice numerical performance of PR and HS methods with the global convergence property of the class of conjugate gradient methods presented by HU and STOREY(1991), a class of new restarting conjugate gradient methods is presented. Global convergences of the new method with two kinds of common line searches, are proved. Firstly, it is shown that, using reverse modulus of continuity function and forcing function, the new method for solving unconstrained optimization can work for a continously dif ferentiable function with Curry-Altman's step size rule and a bounded level set. Secondly, by using comparing technique, some general convergence properties of the new method with other kind of step size rule are established. Numerical experiments show that the new method is efficient by comparing with FR conjugate gradient method.

Multiple linear system techniques for 3D finite element method modeling of direct current resistivity

The strategies that minimize the overall solution time of multiple linear systems in 3D finite element method (FEM) modeling of direct current (DC) resistivity were discussed. A global stiff matrix is assembled and stored in two parts separately. One part is associated with the volume integral and the other is associated with the subsurface boundary integral. The equivalent multiple linear systems with closer right-hand sides than the original systems were constructed. A recycling Krylov subspace technique was employed to solve the multiple linear systems. The solution of the seed system was used as an initial guess for the subsequent systems. The results of two numerical experiments show that the improved algorithm reduces the iterations and CPU time by almost 50%, compared with the classical preconditioned conjugate gradient method.

Bi-conjugate gradient based computation of weight vector in space-time adaptive processing

Dear editor,Space-time adaptive processing(STAP)techniques can effectively suppress strong ground clutter and detect moving target for airborne phased array radar by combing spatial signals and the temporal pulses simultaneously[1].It is known that,when the clutter satisfies the independent and identically-distributed(i.i.d.)condition,the sample matrix inversion(SMI)-based STAP[1]requires twice the number of degree of freedom