Based on block triangular splitting for block 2×2 matrix, the block triangular splitting(BTS)iteration method and the preconditioned block triangular splitting(PBTS)iteration method for a class of complex symmetric linear system are proposed. Theoretical analysis shows that the BTS and PBTS methods converge under certain conditions. The optimal iteration parameters of these two methods are obtained. Numerical experiments demonstrate the effectiveness and superiority of the BTS method and the PBTS iterative methods.

An ultra-weak discontinuous Galerkin(UWDG)method is developed for the drift-diffusion model of the semiconductor problem with the error analysis. The UWDG method has the advantage of the classical discontinuous Galerkin(DG)method. Compared to the local discontinuous Galerkin method, this method can solve partial differential equations with higher-order spatial derivatives without introducing auxiliary variables, which is simpler in scheme and more direct in calculation. The main technical difficulty is to select the appropriate projection for error analysis. A numerical simulation is performed to validate the numerical stability of the UWDG method.

MONES transformation technique is applied to transform the problem of solving nonlinear equation systems into a bi-objective optimization problem, and a dynamic crowding distance strategy of MNSGA-II algorithm is included to dynamically calculate individual crowding distance in the process of population selection, which improves the diversity of Pareto front. In order to verify the performance of algorithm, thirty nonlinear equation systems are selected for testing NSGA-II, dynamic NSGA-II and MNSGA-II algorithm based on MONES transformation technique. Experimental results show that MNSGA-II algorithm based on MONES transformation technique has a better root-found ratio and success rate. Finally, the Pareto front of three algorithms mentioned above is compared, and the uniformity and convergence of Pareto front of the proposed algorithm performs better than others.

In this paper, a high accuracy numerical scheme is constructed for the generalized Burgers-Fisher equation with Dirichlet boundary or Neumann boundary conditions. Firstly, the Lagrange interpolation polynomial differential quadrature method with uniform grid and Chebyshev-Gauss-Lobatto grid is used in space, and the third-order strong stability-preserving Runge-Kutta scheme is used in time. Secondly, the stability of the scheme is analyzed by using the matrix method. Finally, two numerical examples with different boundary conditions are calculated, and the results are compared with other numerical methods to verify the effectiveness of the proposed scheme.

In this paper, an explicit expression of the structured backward error of a generalized saddle point system of a structure is derived, and the structured and unstructured backward errors are compared, and it is found that they can be arbitrarily far apart in some cases.

One nonzero-sum stochastic differential game is considered, whose main feature is that several kinds of delays of the state and the control are involved. The state process can contain distributed delays, discrete delays, and noisy memory, and control processes can contain distributed delays and discrete delays. The control domains are convex sets. Sufficient conditions for the equilibrium point of the game are established by means of the stochastic maximum principle. Finally, an illustrative example is considered for which the equilibrium point is obtained in explicit form.

The optimal local and remote control problem for a multiplicative noise stochastic system consisting of a remote controller and a local controller is investigated. It is assumed that the state information is prone to packet loss and delay when passing through the uplink channel, while the downlink channel is perfect. Firstly, the necessary and sufficient solvability conditions are developed by using the convex variational skill, which shows that the solvability of the optimal local and remote control problem is equivalent to the solvability of the forward and backward stochastic difference equations. Moreover, a novel hierarchical control algorithm is proposed, and the optimal feedback control strategy is obtained by using the complete square method. Finally, a numerical example is shown to illustrate the effectiveness of the obtained results.

For the Aw-Rascle-Zhang(ARZ)non-equilibrium traffic flow model, if the traffic flow at the entrance is constant and the density of the traffic flow at the exit is constant, the system is in critical stability and there will be continuous oscillations near the equilibrium state. This article proposes the design of a time-delay feedback control strategy at the entrance ramp, and characterizes the time-delay term with the solution of the initial value problem of the first-order transportation equation, establishing the form of an infinite dimensional coupled closed-loop system for PDE-PDE. The operator semigroup theory is used to prove the well posedness of the system. The conclusion of exponential stability of the system is obtained by constructing a weighted strict Lyapunov function. The results indicate that when the feedback gain and delay values satisfy certain inequality constraints, the system energy reaches exponential decay. Finally, through numerical simulation, the effectiveness of the designed time-delay controller and the feasibility of parameter conditions are verified.

A class of stochastic predator-prey models with predator-stage structure and rate-dependent Holling III type functional responses are developed. Firstly, the existence and uniqueness of global positive solutions for stochastic model are obtained. Secondly, the existence and uniqueness of the ergodic stationary distribution are studied by constructing a suitable Lyapunov function and using the ergodic theory of Has'Minskii. Next, by solving the corresponding three-dimensional Fokker-Planck equation, the exact expression of the probability density function of the stochastic predator-prey model near the positive equilibrium point is derived. Finally, the rationality of the theoretical results is verified by numerical simulation.

This paper mainly considers the overall structure of Riemann solution and the existence and convergence of shadow wave solutions of the ternary simplified chromatography equations. According to Riemann initial data, and Riemann problem is divided into six different cases, Riemann solutions for the ternary simplified chromatography equations are obtained. When -1<p_-≤0≤p₊, the existence and convergence of shadow wave solutions in the sense of Schwartz distributions are proved. Finally, numerical simulation is given.

A graph whose edges are labeled either as positive or negative is called a signed graph. The product operations, i.e. symmetric product, direct product, semi-strong product and strong product, of signed graphs are given, respectively. The adjacency matrices of these product operation signed graphs in tensor form are obtained, and some relations on the eigenvalues of signed graphs on product operations(direct product, semi-strong product, strong product)are also formulated.

Let f:E(G)→{1,2,…,k} be a non-proper k-edge coloring of G, and 1≤k≤Δ. If for any two adjacent vertices u,v∈V(G) with d(u)=d(v) satisfy C(u)=C(v), f is called a k-vertex-reducible edge coloring, where C(u) denotes the set of colors of edges incident with u. The maximum positive integer k is called vertex-reducible edge chromatic number of G. According to the characters of the lexicographic product graphs, we apply combinatorial analysis to give a lower bound of the vertex reducible edge chromatic number of the lexicographic product G［H］ for simple graphs G and H. As applications, the vertex-reducible edge chromatic numbers of K_n［K2m^-］, K_n［H］ and P_n［H］ are obtained.

The concepts of right regular medial idempotents over the r-wide semigroups is defined. The property characteristics of such idempotents are studied. A construction of r-wide semigroups with a right regular medial idempotents is established.

Let T_n be the full transformation semigroup on X_n={1,2,…,n}. Let 1≤r≤n, putF_(n,r)={α∈T_n:iα=i, ∠i∈{1,2,…,r}},it is obvious that the semigroup F_(n,r) is subsemigroup of T_n. In the paper, we study the core(C F_(n,r))=〈E(F_(n,r))〉 of the semigroup F_(n,r), where E(F_(n,r))={α∈F_(n,r):α²=α}, by analyzing idempotents of the semigroup F_(n,r), we prove that the rank and idempotent rank of semigroup C F_(n,r) are both equal to ((n-r)(n-r-1))/2+r(n-r)+1.