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.

Consensus Control With a Constant Gain for Discrete-time Binary-valued Multi-agent Systems Based on a Projected Empirical Measure Method

This paper studies the consensus control of multiagent systems with binary-valued observations.An algorithm alternating estimation and control is proposed.Each agent estimates the states of its neighbors based on a projected empirical measure method for a holding time.Based on the estimates,each agent designs the consensus control with a constant gain at some skipping time.The states of the system are updated by the designed control,and the estimation and control design will be repeated.For the estimation,the projected empirical measure method is proposed for the binary-valued observations.The algorithm can ensure the uniform boundedness of the estimates and the mean square error of the estimation is proved to be at the order of the reciprocal of the holding time(the same order as that in the case of accurate outputs).For the consensus control,a constant gain is designed instead of the stochastic approximation based gain in the existing literature for binary-valued observations.And,there is no need to make modification for control since the uniform boundedness of the estimates ensures the uniform boundedness of the agents’states.Finally,the systems updated by the designed control are proved to achieve consensus and the consensus speed is faster than that in the existing literature.Simulations are given to demonstrate the theoretical results.

ON THE MONOTONE CONVERGENCE OF THE PROJECTED ITERATION METHODS FOR LINEAR COMPLEMENTARITY PROBLEMS

Under suitable conditions,the monotone convergence about the projected iteration method for solving linear complementarity problem is proved and the influence of the involved parameter matrix on the convergence rate of this method is investigated.

Projected Runge-Kutta methods for constrained Hamiltonian systems

Projected Runge-Kutta （R-K） methods for constrained Hamiltonian systems are proposed. Dynamic equations of the systems, which are index-3 differential-algebraic equations （DAEs） in the Heisenberg form, are established under the framework of Lagrangian multipliers. R-K methods combined with the technique of projections are then used to solve the DAEs. The basic idea of projections is to eliminate the constraint violations at the position, velocity, and acceleration levels, and to preserve the total energy of constrained Hamiltonian systems by correcting variables of the position, velocity, acceleration, and energy. Numerical results confirm the validity and show the high precision of the proposed method in preserving three levels of constraints and total energy compared with results reported in the literature.

An Efficient Projected Gradient Method for Convex Constrained Monotone Equations with Applications in Compressive Sensing

In this paper, a modified Polak-Ribière-Polyak conjugate gradient projection method is proposed for solving large scale nonlinear convex constrained monotone equations based on the projection method of Solodov and Svaiter. The obtained method has low-complexity property and converges globally. Furthermore, this method has also been extended to solve the sparse signal reconstruction in compressive sensing. Numerical experiments illustrate the efficiency of the given method and show that such non-monotone method is suitable for some large scale problems.

Projected gradient trust-region method for solving nonlinear systems with convex constraints

In this paper, a projected gradient trust region algorithm for solving nonlinear equality systems with convex constraints is considered. The global convergence results are developed in a very general setting of computing trial directions by this method combining with the line search technique. Close to the solution set this method is locally Q-superlinearly convergent under an error bound assumption which is much weaker than the standard nonsingularity condition.

Projected subgradient method for non-Lipschitz set-valued mixed variational inequalities

A projected subgradient method for solving a class of set-valued mixed variational inequalities （SMVIs） is proposed when the mapping is not necessarily Lipschitz. Under some suitable conditions, it can be proven that the sequence generated by the method can strongly converge to the unique solution to the problem in the Hilbert spaces.

A Spectral Projected Gradient-Newton Two Phase Method for Constrained Nonlinear Equations

In this paper, we proposed a spectral gradient-Newton two phase method for constrained semismooth equations. In the first stage, we use the spectral projected gradient to obtain the global convergence of the algorithm, and then use the final point in the first stage as a new initial point to turn to a projected semismooth asymptotically newton method for fast convergence.

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.

Multi-Parameter Design and Optimization for the Decomposition Projective Method and Its Applications

In order to solve the electromagnetic problems on the large multi branch domains, the decomposition projective method(DPM) is generalized for multi subspaces in this paper. Furthermore multi parameters are designed for DPM, which is called the fast DPM(FDPM), and the convergence ratio of the above algorithm is greatly increased. The examples show that the iterative number of the FDPM with optimal parameters decreases much more, which is less than one third of the DPM iteration number. After studying the ...

ANonmonotone Projected Gradient Method for Multiobjective Problems on Convex Sets

In this work we consider an extension of the classical scalar-valued projected gradient method for multiobjective problems on convex sets.As in Fazzio et al.(Optim Lett 13:1365-1379,2019)a parameter which controls the step length is considered and an updating rule based on the spectral gradient method from the scalar case is proposed.In the present paper,we consider an extension of the traditional nonmonotone approach of Grippo et al.(SIAM J Numer Anal 23:707-716,1986)based on the maximum of some previous function values as suggested in Mita et al.(J Glob Optim 75:539-559,2019)for unconstrained multiobjective optimization problems.We prove the accumulation points of sequences generated by the proposed algorithm,if they exist,are stationary points of the original problem.Numerical experiments are reported.

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.

New Exact Travelling Wave Solutions for Generalized Zakharov-Kuzentsov EquationsUsing General Projective Riccati Equation Method

Applying the generalized method, which is a direct and unified algebraic method for constructing multipletravelling wave solutions of nonlinear partial differential equations (PDEs), and implementing in a computer algebraicsystem, we consider the generalized Zakharov-Kuzentsov equation with nonlinear terms of any order. As a result, wecan not only successfully recover the previously known travelling wave solutions found by existing various tanh methodsand other sophisticated methods, but also obtain some new formal solutions. The solutions obtained include kink-shapedsolitons, bell-shaped solitons, singular solitons, and periodic solutions.

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.

A SUBSPACE PROJECTED CONJUGATE GRADIENT ALGORITHM FOR LARGE BOUND CONSTRAINED QUADRATIC PROGRAMMING

A subspace projected conjugate gradient method is proposed for solving large bound constrained quadratic programming. The conjugate gradient method is used to update the variables with indices outside of the active set, while the projected gradient method is used to update the active variables. At every iterative level, the search direction consists of two parts, one of which is a subspace trumcated Newton direction, another is a modified gradient direction. With the projected search the algorithm is suitable to large problems. The convergence of the method is proved and same numerical tests with dimensions ranging from 5000 to 20000 are given.

A CLASS OF MULTIWAVELETS AND PROJECTED FRAMES FROM TWO-DIRECTION WAVELETS

This article aims at studying two-direction refinable functions and two-direction wavelets in the setting R^s, s 〉 1. We give a sufficient condition for a two-direction refinable function belonging to L^2（R^s）. Then, two theorems are given for constructing biorthogonal （orthogonal） two-direction refinable functions in L^2（R^s） and their biorthogonal （orthogonal） two-direction wavelets, respectively. From the constructed biorthogonal （orthogonal） two-direction wavelets, symmetric biorthogonal （orthogonal） multiwaveles in L^2（R^s） can be obtained easily. Applying the projection method to biorthogonal （orthogonal） two-direction wavelets in L^2（R^s）, we can get dual （tight） two-direction wavelet frames in L^2（R^m）, where m ≤ s. From the projected dual （tight） two-direction wavelet frames in L^2（R^m）, symmetric dual （tight） frames in L^2（R^m） can be obtained easily. In the end, an example is given to illustrate theoretical results.

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.