اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدM-Tensors and Nonsingular M-Tensors
124
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The M-matrix is an important concept in matrix theory, and has many applications. Recently, this concept has been extended to higher order tensors [18]. In this paper, we establish some important properties of M-tensors and nonsingular M-tensors. An M-tensor is a Z-tensor. We show that a Z-tensor is a nonsingular M-tensor if and only if it is semi-positive. Thus, a nonsingular M-tensor has all positive diagonal entries; and an M-tensor, regarding as the limitation of a series of nonsingular M-tensors, has all nonnegative diagonal entries. We introduce even-order monotone tensors and present their spectral properties. In matrix theory, a Z-matrix is a nonsingular M-matrix if and only if it is monotone. This is no longer true in the case of higher order tensors. We show that an even-order monotone Z-tensor is an even-order nonsingular M-tensor but not vice versa. An example of an even-order nontrivial monotone Z-tensor is also given.
قيم البحث
اقرأ أيضاً
In this paper, we establish two sufficient conditions for the strong ellipticity of any fourth-order elasticity tensor and investigate a class of tensors satisfying the strong ellipticity condition, the elasticity $mathscr{M}$-tensor. The first suffi
cient condition is that the strong ellipticity holds if the unfolding matrix of this fourth-order elasticity tensor can be modified into a positive definite one by preserving the summations of some corresponding entries. Second, an alternating projection algorithm is proposed to verify whether an elasticity tensor satisfies the first condition or not. Besides, the elasticity $mathscr{M}$-tensor is defined with respect to the M-eigenvalues of elasticity tensors. We prove that any nonsingular elasticity $mathscr{M}$-tensor satisfies the strong ellipticity condition by employing a Perron-Frobenius-type theorem for M-spectral radii of nonnegative elasticity tensors. Other equivalent definitions of nonsingular elasticity $mathscr{M}$-tensors are also established.
The notion of a tensor captures three great ideas: equivariance, multilinearity, separability. But trying to be three things at once makes the notion difficult to understand. We will explain tensors in an accessible and elementary way through the len
s of linear algebra and numerical linear algebra, elucidated with examples from computational and applied mathematics.
Symmetric tensor operations arise in a wide variety of computations. However, the benefits of exploiting symmetry in order to reduce storage and computation is in conflict with a desire to simplify memory access patterns. In this paper, we propose a
blocked data structure (Blocked Compact Symmetric Storage) wherein we consider the tensor by blocks and store only the unique blocks of a symmetric tensor. We propose an algorithm-by-blocks, already shown of benefit for matrix computations, that exploits this storage format by utilizing a series of temporary tensors to avoid redundant computation. Further, partial symmetry within temporaries is exploited to further avoid redundant storage and redundant computation. A detailed analysis shows that, relative to storing and computing with tensors without taking advantage of symmetry and partial symmetry, storage requirements are reduced by a factor of $ Oleft( m! right)$ and computational requirements by a factor of $Oleft( (m+1)!/2^m right)$, where $ m $ is the order of the tensor. However, as the analysis shows, care must be taken in choosing the correct block size to ensure these storage and computational benefits are achieved (particularly for low-order tensors). An implementation demonstrates that storage is greatly reduced and the complexity introduced by storing and computing with tensors by blocks is manageable. Preliminary results demonstrate that computational time is also reduced. The paper concludes with a discussion of how insights in this paper point to opportunities for generalizing recent advances in the domain of linear algebra libraries to the field of multi-linear computation.
A third order real tensor is mapped to a special f-diagonal tensor by going through Discrete Fourier Transform (DFT), standard matrix SVD and inverse DFT. We call such an f-diagonal tensor an s-diagonal tensor. An f-diagonal tensor is an s-diagonal t
ensor if and only if it is mapped to itself in the above process. The third order tensor space is partitioned to orthogonal equivalence classes. Each orthogonal equivalence class has a unique s-diagonal tensor. Two s-diagonal tensors are equal if they are orthogonally equivalent. Third order tensors in an orthogonal equivalence class have the same tensor tubal rank and T-singular values. Four meaningful necessary conditions for s-diagonal tensors are presented. Then we present a set of sufficient and necessary conditions for s-diagonal tensors. Such conditions involve a special complex number. In the cases that the dimension of the third mode of the considered tensor is $2, 3$ and $4$, we present direct sufficient and necessary conditions which do not involve such a complex number.
The concepts of P- and P$_0$-matrices are generalized to P- and P$_0$-tensors of even and odd orders via homogeneous formulae. Analog to the matrix case, our P-tensor definition encompasses many important classes of tensors such as the positive defin
ite tensors, the nonsingular M-tensors, the nonsingular H-tensors with positive diagonal entries, the strictly diagonally dominant tensors with positive diagonal entries, etc. As even-order symmetric PSD tensors are exactly even-order symmetric P$_0$-tensors, our definition of P$_0$-tensors, to some extent, can be regarded as an extension of PSD tensors for the odd-order case. Along with the basic properties of P- and P$_0$-tensors, the relationship among P$_0$-tensors and other extensions of PSD tensors are then discussed for comparison. Many structured tensors are also shown to be P- and P$_0$-tensors. As a theoretical application, the P-tensor complementarity problem is discussed and shown to possess a nonempty and compact solution set.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
