Results 1 to 10 of about 835 (69)
An ℋ-tensor-based criteria for testing the positive definiteness of multivariate homogeneous forms
A positive definite homogeneous multivariate form plays an important role in the field of optimization, and positive definiteness of the form can be identified by a special structured tensor.
Bai Dongjian, Wang Feng
doaj +1 more source
A generalization of Kruskal’s theorem on tensor decomposition
Kruskal’s theorem states that a sum of product tensors constitutes a unique tensor rank decomposition if the so-called k-ranks of the product tensors are large.
Benjamin Lovitz, Fedor Petrov
doaj +1 more source
Positive definite polynomials are important in the field of optimization. ℋ-tensors play an important role in identifing the positive definiteness of an even-order homogeneous multivariate form.
Sun Deshu, Bai Dongjian
doaj +1 more source
New iterative codes for 𝓗-tensors and an application
New iterative codes for identifying 𝓗 -tensor are obtained. As an application, some sufficient conditions of the positive definiteness for an even-order real symmetric tensor, i.e., an even-degree homogeneous polynomial form are given.
Wang Feng, Sun Deshu
doaj +1 more source
A higher dimensional generalization of the cross product is associated with an adequate matrix multiplication. This index-free view allows for a better understanding of the underlying algebraic structures, among which are generalizations of Grassmann’s ...
Lewintan Peter
doaj +1 more source
Bounds for the Z-eigenpair of general nonnegative tensors
In this paper, we consider the Z-eigenpair of a tensor. A lower bound and an upper bound for the Z-spectral radius of a weakly symmetric nonnegative irreducible tensor are presented.
Liu Qilong, Li Yaotang
doaj +1 more source
Plethysm and fast matrix multiplication [PDF]
Motivated by the symmetric version of matrix multiplication we study the plethysm $S^k(\mathfrak{sl}_n)$ of the adjoint representation $\mathfrak{sl}_n$ of the Lie group $SL_n$.
Seynnaeve, Tim
core +3 more sources
A binary encoding of spinors and applications
We present a binary code for spinors and Clifford multiplication using non-negative integers and their binary expressions, which can be easily implemented in computer programs for explicit calculations.
Arizmendi Gerardo, Herrera Rafael
doaj +1 more source
Effective identifiability criteria for tensors and polynomials [PDF]
A tensor $T$, in a given tensor space, is said to be $h$-identifiable if it admits a unique decomposition as a sum of $h$ rank one tensors. A criterion for $h$-identifiability is called effective if it is satisfied in a dense, open subset of the set of ...
Massarenti, Alex +2 more
core +2 more sources
A note on the three-way generalization of the Jordan canonical form
The limit point 𝓧 of an approximating rank-R sequence of a tensor Ƶ can be obtained by fitting a decomposition (S, T, U) ⋅ 𝓖 to Ƶ. The decomposition of the limit point 𝓧 = (S, T, U) ⋅ 𝓖 with 𝓖 = blockdiag(𝓖1, … , 𝓖m) can be seen as a three order ...
Cui Lu-Bin, Li Ming-Hui
doaj +1 more source

