Results 31 to 40 of about 57 (54)
Geršhgorin-type theorems for Z1-eigenvalues of tensors with applications
Demonstratio MathematicaIn this article, we present several Geršhgorin-type theorems for Z1{Z}_{1}-eigenvalues of tensors, which improve the results provided by Wang et al. (Some upper bounds on Zt{Z}_{t}-eigenvalues of tensors, Appl. Math. Comput.
Shen Xiaowei +3 more
doaj +1 more source
Characteristic numbers and chromatic polynomial of a tensor
Forum of Mathematics, SigmaWe introduce the characteristic numbers and the chromatic polynomial of a linear subspace of matrices, or equivalently of a tensor. Our approach generalizes and unifies the chromatic polynomial of a graph and of a matroid, characteristic numbers of ...
Austin Conner, Mateusz Michalek
doaj +1 more source
Absolute And Relative Perturbation Bounds For Invariant Subspaces Of Matrices
, 1998 . Absolute and relative perturbation bounds are derived for angles between invariant subspaces of complex square matrices, in the two-norm and in the Frobenius norm.
Ilse C. F. Ipsen
core
A generalization of the Graham-Pollak tree theorem to even-order Steiner distance
Special MatricesGraham and Pollak showed in 1971 that the determinant of a tree’s distance matrix depends only on its number of vertices, and, in particular, it is always nonzero.
Cooper Joshua, Tauscheck Gabrielle
doaj +1 more source
Tensor Decompositions and Applications
SIAM Review, 2009 . This survey provides an overview of higher-order tensor decompositions, their applications, and available software. A tensor is a multidimensional or N-way array.
Tamara Kolda, Brett W Bader
exaly +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches: