Block tensors and symmetric embeddings
From MaRDI portal
Publication:1931772
DOI10.1016/j.laa.2011.04.014zbMath1390.15082arXiv1010.0707OpenAlexW2963242183MaRDI QIDQ1931772
Stefan Ragnarsson, Charles F. Van Loan
Publication date: 16 January 2013
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.0707
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69)
Related Items (22)
Combinatorial methods for the spectral \(p\)-norm of hypermatrices ⋮ Further results for \(Z\)-eigenvalue localization theorem for higher-order tensors and their applications ⋮ On norm compression inequalities for partitioned block tensors ⋮ Orthogonal and unitary tensor decomposition from an algebraic perspective ⋮ Some new \(Z\)-eigenvalue localization sets for even-order tensors and their application in the geometric measure of entanglement ⋮ Extreme Ratio Between Spectral and Frobenius Norms of Nonnegative Tensors ⋮ The solution methods for the largest eigenvalue (singular value) of nonnegative tensors and convergence analysis ⋮ Structured Matrix Problems from Tensors ⋮ A tensor singular values and its symmetric embedding eigenvalues ⋮ Properties and methods for finding the best rank-one approximation to higher-order tensors ⋮ Iterative algorithms for computing US- and U-eigenpairs of complex tensors ⋮ On cones of nonnegative quartic forms ⋮ Standard tensor and its applications in problem of singular values of tensors ⋮ Perturbation bounds of tensor eigenvalue and singular value problems with even order ⋮ A new centrality measure of nodes in multilayer networks under the framework of tensor computation ⋮ A TT-Based Hierarchical Framework for Decomposing High-Order Tensors ⋮ Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement ⋮ Bounds on the Spectral Norm and the Nuclear Norm of a Tensor Based on Tensor Partitions ⋮ Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems ⋮ Multilinear Control Systems Theory ⋮ Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking ⋮ The geometric measure of entanglement of multipartite states and the \(Z\)-eigenvalue of tensors
Cites Work
- Unnamed Item
- Unnamed Item
- Eigenvalues and invariants of tensors
- The number of eigenvalues of a tensor
- Eigenvalues of a real supersymmetric tensor
- Rank and eigenvalues of a supersymmetric tensor, the multivariate homogeneous polynomial and the algebraic hypersurface it defines
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- Shifted Power Method for Computing Tensor Eigenpairs
- On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors
- Algorithm 862
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Most Tensor Problems Are NP-Hard
This page was built for publication: Block tensors and symmetric embeddings