Cascading multi-segment rupture process of the 2023 Turkish earthquake doublet on a complex fault system revealed by teleseismic P wave back projection method

In this study,the vertical components of broadband teleseismic P wave data recorded by China Earthquake Network are used to image the rupture processes of the February 6th,2023 Turkish earthquake doublet via back projection analysis.Data in two frequency bands(0.5-2 Hz and 1-3 Hz)are used in the imaging processes.The results show that the rupture of the first event extends about 200 km to the northeast and about 150 km to the southwest,lasting~90 s in total.The southwestern rupture is triggered by the northeastern rupture,demonstrating a sequential bidirectional unilateral rupture pattern.The rupture of the second event extends approximately 80 km in both northeast and west directions,lasting~35 s in total and demonstrates a typical bilateral rupture feature.The cascading ruptures on both sides also reflect the occurrence of selective rupture behaviors on bifurcated faults.In addition,we observe super-shear ruptures on certain fault sections with relatively straight fault structures and sparse aftershocks.

New algorithm for solving 3D incompressible viscous equations based on projection method

A new algorithm based on the projection method with the implicit finite difference technique was established to calculate the velocity fields and pressure.The calculation region can be divided into different regions according to Reynolds number.In the far-wall region,the thermal melt flow was calculated as Newtonian flow.In the near-wall region,the thermal melt flow was calculated as non-Newtonian flow.It was proved that the new algorithm based on the projection method with the implicit technique was correct through nonparametric statistics method and experiment.The simulation results show that the new algorithm based on the projection method with the implicit technique calculates more quickly than the solution algorithm-volume of fluid method using the explicit difference method.

基于Projection VOF方法的熔模铸造蜡模充型过程数值模拟

针对熔模铸造蜡模充型过程数值模拟软件自主开发,建立了流动场和温度场数学模型,采用Cross-WLF粘度模型描述蜡料的流变性能,基于Projection VOF方法进行蜡料流动过程速度场、压力场以及自由表面的求解。通过试验测量获取了K512型蜡料的热物理性能和流变性能的相关数据,拟合得到粘度模型参数。分别在蜡料常粘度和变粘度模型两种条件下对扳机铸件蜡模充型过程进行模拟,结果表明,所建立蜡模充型过程数学模型能较好地描述蜡料的动态流变特性和传热行为。

Self-adaptive one-dimensional nonlinear finite element method based on element energy projection method

The element energy projection （EEP） method for computation of super- convergent resulting in a one-dimensional finite element method （FEM） is successfully used to self-adaptive FEM analysis of various linear problems, based on which this paper presents a substantial extension of the whole set of technology to nonlinear problems. The main idea behind the technology transfer from linear analysis to nonlinear analysis is to use Newton＇s method to linearize nonlinear problems into a series of linear problems so that the EEP formulation and the corresponding adaptive strategy can be directly used without the need for specific super-convergence formulation for nonlinear FEM. As a re- sult, a unified and general self-adaptive algorithm for nonlinear FEM analysis is formed. The proposed algorithm is found to be able to produce satisfactory finite element results with accuracy satisfying the user-preset error tolerances by maximum norm anywhere on the mesh. Taking the nonlinear ordinary differential equation （ODE） of second-order as the model problem, this paper describes the related fundamental idea, the imple- mentation strategy, and the computational algorithm. Representative numerical exam- ples are given to show the efficiency, stability, versatility, and reliability of the proposed approach.

Low side lobe pattern synthesis using projection method with genetic algorithm for truncated cone conformal phased arrays

A hybrid method for synthesizing antenna＇s three dimensional （3D） pattern is proposed to obtain the low sidelobe feature of truncated cone conformal phased arrays. In this method, the elements of truncated cone conformal phased arrays are projected to the tangent plane in one generatrix of the truncated cone. Then two dimensional （2D） Chebyshev amplitude distribution optimization is respectively used in two mutual vertical directions of the tangent plane. According to the location of the elements, the excitation current amplitude distribution of each element on the conformal structure is derived reversely, then the excitation current amplitude is further optimized by using the genetic algorithm （GA）. A truncated cone problem with 8x8 elements on it, and a 3D pattern desired side lobe level （SLL） up to 35 dB, is studied. By using the hybrid method, the optimal goal is accomplished with acceptable CPU time, which indicates that this hybrid method for the low sidelobe synthesis is feasible.

Program evaluation and its application to equipment based on super-efficiency DEA and gray relation projection method

For the gray attributes of the equipment program and its difficulty to carry out the quantitative assessment of the equipment program information, the gray relation projection method is simply reviewed. Combining the super-data envelopment analysis（DEA） model and the gray system theory, a new super-DEA for measuring the weight is proposed, and a gray relation projection model is established to rank the equipment programs. Finally, this approach is used to evaluate the equipment program. The results are verified valid and can provide a new way for evaluating the equipment program.

Superconvergence of nonconforming finite element penalty scheme for Stokes problem using L^2 projection method

A modified penalty scheme is discussed for solving the Stokes problem with the Crouzeix-Raviart type nonconforming linear triangular finite element. By the L^2 projection method, the superconvergence results for the velocity and pressure are obtained with a penalty parameter larger than that of the classical penalty scheme. The numerical experiments are carried out to confirm the theoretical results.

Projection and Contraction Methods for Nonlinear Complementarity Problem

We applied the projection and contraction method to nonlinear complementarity problem (NCP). Moveover, we proposed an inexact implicit method for (NCP) and proved the convergence.

SELF-ADAPTIVE STRATEGY FOR ONE-DIMENSIONAL FINITE ELEMENT METHOD BASED ON ELEMENT ENERGY PROJECTION METHOD

Based on the newly-developed element energy projection （EEP） method for computation of super-convergent results in one-dimensional finite element method （FEM）, the task of self-adaptive FEM analysis was converted into the task of adaptive piecewise polynomial interpolation. As a result, a satisfactory FEM mesh can be obtained, and further FEM analysis on this mesh would immediately produce an FEM solution which usually satisfies the user specified error tolerance. Even though the error tolerance was not completely satisfied, one or two steps of further local refinements would be sufficient. This strategy was found to be very simple, rapid, cheap and efficient. Taking the elliptical ordinary differential equation of second order as the model problem, the fundamental idea, implementation strategy and detailed algorithm are described. Representative numerical examples are given to show the effectiveness and reliability of the proposed approach.

Accelerated Matrix Recovery via Random Projection Based on Inexact Augmented Lagrange Multiplier Method

In this paper, a unified matrix recovery model was proposed for diverse corrupted matrices. Resulting from the separable structure of the proposed model, the convex optimization problem can be solved efficiently by adopting an inexact augmented Lagrange multiplier (IALM) method. Additionally, a random projection accelerated technique (IALM+RP) was adopted to improve the success rate. From the preliminary numerical comparisons, it was indicated that for the standard robust principal component analysis (PCA) problem, IALM+RP was at least two to six times faster than IALM with an insignificant reduction in accuracy; and for the outlier pursuit (OP) problem, IALM+RP was at least 6.9 times faster, even up to 8.3 times faster when the size of matrix was 2 000×2 000.

A class of fully third-order accurate projection methods for solving the incompressible Navier-Stokes equations

In this paper, a fully third-order accurate projection method for solving the incompressible Navier-Stokes equations is proposed. To construct the scheme, a continuous projection procedure is firstly presented. We then derive a sufficient condition for the continuous projection equations to be temporally third-order accurate approximations of the original Navier-Stokes equations by means of the localtruncation-error-analysis technique. The continuous projection equations are discretized temporally and spatially to third-order accuracy on the staggered grids, resulting in a fully third-order discrete projection scheme. The possibility to design higher-order projection methods is thus demonstrated in the present paper. A heuristic stability analysis is performed on this projection method showing the probability of its being stable. The stability of the present scheme is further verified through numerical tests. The third-order accuracy of the present projection method is validated by several numerical test cases.

A New Conjugate Gradient Projection Method for Solving Stochastic Generalized Linear Complementarity Problems

In this paper, a class of the stochastic generalized linear complementarity problems with finitely many elements is proposed for the first time. Based on the Fischer-Burmeister function, a new conjugate gradient projection method is given for solving the stochastic generalized linear complementarity problems. The global convergence of the conjugate gradient projection method is proved and the related numerical results are also reported.

PROJECTION METHODS AND APPROXIMATIONS FOR ORDINARY DIFFERENTIAL EQUATIONS

A formulation of a differential equation as projection and fixed point pi-Mem alloivs approximations using general piecnvise functions. We prone existence and uniqueness of the up proximate solution* convergence in the L2 norm and nodal supercnnvergence. These results generalize those obtained earlier by Hulme for continuous piecevjise polynomials and by Delfour-Dubeau for discontinuous pieceuiise polynomials. A duality relationship for the two types of approximations is also given.

CONSTRUCTIONS OF BASES FOR EXTENDED OBLIQUE PROJECTION METHOD

In this paper,we present some sufficient conditions for constructing the bases of the left and the right spaces to ensure the feasibility of the oblique projection method and the extended oblique projection method.

A NEW GRADIENT PROJECTION METHOD AND ITS CONVERGENCE

In this paper, by using a new projection, we construct a variant of Zhang’s algorithm and prove its convergence. Specially, the variant of Zhang’s algorithm has quadratic termination and superlinear convergence rale under certain conditions. Zhang’s algorithm hasn’t these properties.

EXTENDED OBLIQUE PROJECTION METHOD FOR GENERALIZED LEAST SQUARES PROBLEM

We extend the oblique projection method given by Y.Saad to solve the generalized least squares problem. The corresponding oblique projection operator is presented and the convergence theorems are proved. Some necessary and sufficient conditions for computing the solution or the minimum N-norm solution of the min || A x- b ||M2 have been proposed as well.

Essential consistency of pressure Poisson equation method and projection method on staggered grids

A new pressure Poisson equation method with viscous terms is established on staggered grids. The derivations show that the newly established pressure equation has the identical equation form in the projection method. The results show that the two methods have the same velocity and pressure values except slight differences in the CPU time.

A Modified Projection Method for Linear Feasibility Problems

In this paper, we present a modified projection method for the linear feasibility problems （LFP）. Compared with the existing methods, the new method adopts a surrogate technique to obtain new iteration instead of the line search procedure with fixed stepsize. For the new method, we first show its global convergence under the condition that the solution set is nonempty, and then establish its linear convergence rate. Preliminary numerical experiments show that this method has good performance.

Reduced projection augmented Lagrange bi-conjugate gradient method for contact and impact problems

Based on the numerical governing formulation and non-linear complementary conditions of contact and impact problems, a reduced projection augmented Lagrange bi- conjugate gradient method is proposed for contact and impact problems by translating non-linear complementary conditions into equivalent formulation of non-linear program- ming. For contact-impact problems, a larger time-step can be adopted arriving at numer- ical convergence compared with penalty method. By establishment of the impact-contact formulations which are equivalent with original non-linear complementary conditions, a reduced projection augmented Lagrange bi-conjugate gradient method is deduced to im- prove precision and efficiency of numerical solutions. A numerical example shows that the algorithm we suggested is valid and exact.

Finite Element Method Computations of the Acoustics of the Human Head Based on the Projection Based Interpolation Data

In this paper we present the Projection Based Interpolation (PBI) technique for construction of continuous approximation of MRI scan data of the human head. We utilize the result of the PBI algorithm to perform three dimensional (3D) Finite Element Method (FEM) simulations of the acoustics of the human head. The computational problem is a multi-physics problem modeled as acoustics coupled with linear elasticity. The computational grid contains tetrahedral finite elements with the number of equations and polynomial orders of approximation varying locally on finite element edges, faces, and interiors. We utilize our own out-of-core parallel direct solver for the solution of this multi-physics problem. The solver minimizes the memory usage by dumping out all local systems from all nodes of the entire elimination tree during the elimination phase.