2015
DOI: 10.1080/03081087.2015.1071311
|View full text |Cite
|
Sign up to set email alerts
|

An eigenvalue problem for even order tensors with its applications

Abstract: In this paper, we study an eigenvalue problem for even order tensors. Using the matrix unfolding of even order tensors, we can establish the relationship between a tensor eigenvalue problem and a multilevel matrix eigenvalue problem. By considering a higher order singular value decomposition of a tensor, we show that higher order singular values are the square root of the eigenvalues of the product of the tensor and its conjugate transpose. This result is similar to that in matrix case. Also we study an eigenv… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
34
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 64 publications
(34 citation statements)
references
References 25 publications
0
34
0
Order By: Relevance
“…Brazell et al [7] investigated properties for even-order non-paired tensors A ∈ R J1×···×JN ×I1×···×IN under the Einstein product through construction of an isomorphism to GL(R) (general linear group). The existence of the isomorphism enables one to generalize several matrix concepts, such as orthogonality, invertibility and eigenvalue decomposition to the tensor case [7,14,15,16,17]. We establish an analogous isomorphism for even-order paired tensors by a permutation of indices.…”
Section: Einstein Product and Isomorphismmentioning
confidence: 90%
“…Brazell et al [7] investigated properties for even-order non-paired tensors A ∈ R J1×···×JN ×I1×···×IN under the Einstein product through construction of an isomorphism to GL(R) (general linear group). The existence of the isomorphism enables one to generalize several matrix concepts, such as orthogonality, invertibility and eigenvalue decomposition to the tensor case [7,14,15,16,17]. We establish an analogous isomorphism for even-order paired tensors by a permutation of indices.…”
Section: Einstein Product and Isomorphismmentioning
confidence: 90%
“…Due to various new and important applications of E-eigenvalue problem in numerical multilinear algebra [21], image processing [22], higher order Markov chains [23], spectral hypergraph theory, the study of quantum entanglement, and so on, some properties of E-eigenvalues have been studied systematically; see [8] for details. However, characterizations of inclusion set for E-eigenvalue are still underdeveloped.…”
Section: Theorem 14 [6 Theorem 46] Letmentioning
confidence: 99%
“…Different from the tensor equations (1)–(3), another type of tensor equations is based on the Einstein product. The tensor equation via the Einstein product comes from engineering, the isotropic and anisotropic elastic models, 14 the brain MRI images restoration, 15,16 the biomedical science, 17 the finite element, 18 the finite difference or the spectral method 9,12 and plays very vital role in the discretization of some linear partial differential equations in high dimension. Such as, in physics, for noncentrosymmetric materials, the linear piezoelectric equation is expressed as 19 𝒜˜2T=p, where 𝒜˜3×3×3 is a piezoelectric tensor, T3×3 is a stress tensor, and p3 is the electric change density displacement.…”
Section: Introductionmentioning
confidence: 99%
“…The three‐dimensional model of image formation can be expressed as the convolution of an object and a point spread function associated with the noise 20 G(x,y,z)=F(x,y,z)S(x,y,z)+N(x,y,z), where G ( x , y , z ) is the image, F ( x , y , z ) is the object, N ( x , y , z ) is the noise, and denotes the three‐dimensional convolution operator. Using the tensor representation, we can rewritten (5) as 15 𝒢=𝒯3+𝒩, where 𝒢, , and 𝒩 are third‐order tensor representations for the image, the object, and noise functions, respectively, and 𝒯 is the sixth‐order Toeplitz tensor (convolution operator) obtained from a third‐order tensor 𝒮, that is, 𝒯(i1,i2,i3,j1,j2,j3)=𝒮(j1i1,j2i2,j3i3),1ik,jknk,1k3. …”
Section: Introductionmentioning
confidence: 99%