Projection-type methods are studied widely and deeply to solve multiples-sets split feasibility problem. From the perspective of splitting iteration, in this paper, the efficient tensor projection-splitting iteration methods are firstly investigated for solving tensor split feasibility problem, which is properly transformed into a tensor equation by taking advantage of projection operator. Then, accelerated overrelaxation method and symmetric (alternating) accelerated overrelaxation method are further generalized to solve this problem from general system of linear equations to multi-linear systems. Theoretically, the convergence is proven by the analysis of spectral radius of splitting iteration tensor. Numerical experiments demonstrate the efficiency of the presented method.

Nonlinear matrix equation often arises in control theory, statistics, dynamic programming, ladder networks, and so on, so it has widely applied background. In this paper, the nonlinear matrix equation $X^s+A^{H}F(X)A=Q$ are discussed, where operator $F$ are defined in the set of all $n\times n$ positive semi-definite matrices, and $Q$ is a positive definite matrix. Sufficient conditions for the existence and uniqueness of a positive semi-definite solution are derived based on some fixed point theorems. It is shown that under suitable conditions an iteration method converges to a positive semi-definite solution. Moreover, we consider the perturbation analysis for the solution of this class of nonlinear matrix equations, and obtain a perturbation bound of the solution. Finally, we give several examples to show how this works in particular cases, and some numerical results to specify the rationality of the results we have obtain.