Search

Theory of numerical range and numerical radius for tensors is not studied much in the literature. Ke et al. [Linear Algebra Appl. 508 (2016), 100-132: MR3542984] introduced first the notion of the numerical range of a tensor via the k-mode product. However, the convexity of the numerical range via the k-mode product was not proved by them. In this paper, the notion of numerical range and numerical radius for even-order square tensors via the Einstein product are introduced first. Using the notion of the numerical radius of a tensor, we provide some sufficient conditions for a tensor to be unitary. The convexity of the numerical range is also proved. We also provide an algorithm to plot the numerical range of a tensor. Furthermore, some properties of the numerical range for the Moore–Penrose inverse of a tensor are discussed. [ABSTRACT FROM AUTHOR]

Iterative methods based on matrix splittings are useful tools in solving real large sparse linear systems. In this aspect, the type I double splitting approaches are straight forward from the formulation of the iteration scheme and its convergence theory is well established in the literature. However, if a double splitting is of type II, then the convergence of the iteration scheme seems not to be straight forward. In this paper, we develop convergence theory for type II double splittings to make the implementation quite simple. In this direction, we first introduce two new subclasses of double splittings and establish their convergence theory. Using this theory, we prove a new characterization of a monotone matrix. Finally, we apply our theoretical findings to the double splitting of an M-matrix in the Gauss–Seidel double SOR method to obtain a comparison result. [ABSTRACT FROM AUTHOR]

The notion of the Moore–Penrose inverse of an even-order tensor and the two-term reverse-order law for the Moore–Penrose inverse of even-order tensors via the Einstein product were introduced, very recently. In this article, the Moore–Penrose inverse of an arbitrary tensor is introduced first. Various new expressions of the Moore–Penrose inverse are also proposed. A new generalized inverse of a tensor called product Moore–Penrose inverse is then introduced by extending the Moore–Penrose inverse of an arbitrary tensor. A necessary and sufficient condition for the coincidence of the Moore–Penrose inverse and the product Moore–Penrose inverse of an arbitrary tensor is also provided. Prior to these, a set of new sufficient conditions for computing the Moore–Penrose inverse of the product of two tensors via the Einstein product is illustrated. Finally, some necessary and sufficient conditions are obtained for the three-term reverse-order law of tensors via the same product. [ABSTRACT FROM AUTHOR]

Reverse-order law for the Moore–Penrose inverses of tensors is useful in the field of multilinear algebra. In this paper, we first prove some more identities involving the Moore–Penrose inverses of tensors. We then obtain a few necessary and sufficient conditions of the reverse-order law for the Moore–Penrose inverses of tensors via the Einstein product. [ABSTRACT FROM AUTHOR]

The notion of the Moore–Penrose inverse of tensors with the Einstein product was introduced, very recently. In this paper, we further elaborate on this theory by producing a few characterizations of different generalized inverses of tensors. A new method to compute the Moore–Penrose inverse of tensors is proposed. Reverse order laws for several generalized inverses of tensors are also presented. In addition to these, we discuss general solutions of multilinear systems of tensors using such theory. [ABSTRACT FROM AUTHOR]

Different classes of matrix splittings of semi-monotone matrices lead to many comparison results, which are useful tools in examining the convergence rate of iterative methods for solving rectangular systems of linear equations in a faster way. In this context, the theory of alternating iterations for rectangular matrices was introduced recently, in order to arrive at the desired solution of accuracy or at the exact solution. In this article, we expand convergence theory of such alternating iterations and obtain comparison results for such iterations. [ABSTRACT FROM AUTHOR]