Numerical multilinear algebra and its applications

DOI10.1007/s11464-007-0031-4zbMath1134.65033OpenAlexW2204118584MaRDI QIDQ2477577

Liqun Qi, Wen-Yu Sun, Y. J. Wang

Publication date: 14 March 2008

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-007-0031-4

zbMATH Keywords

eigenvaluessurvey papertensor decompositionmulti-way data analysishigher order tensornumerical multilinear algebralower rank approximation of tensor

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to statistics (62-02) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69)

Related Items

New bounds for the spectral radius for nonnegative tensors ⋮ Minimal Geršgorin tensor eigenvalue inclusion set and its approximation ⋮ Further results on sum-of-squares tensors ⋮ A trust region algorithm for computing extreme eigenvalues of tensors ⋮ Further results for \(Z\)-eigenvalue localization theorem for higher-order tensors and their applications ⋮ Tensor norm and maximal singular vectors of nonnegative tensors -- a Perron-Frobenius theorem, a Collatz-Wielandt characterization and a generalized power method ⋮ A seminorm regularized alternating least squares algorithm for canonical tensor decomposition ⋮ Numerical ranges of tensors ⋮ A projection method and Kronecker product preconditioner for solving Sylvester tensor equations ⋮ Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors ⋮ The power method for tensor eigenproblems and limiting directions of Newton iterates ⋮ Structured multi-way arrays and their applications ⋮ Perron-Frobenius theory for some classes of nonnegative tensors in the max algebra ⋮ Dynamical analysis of quantum linear systems driven by multi-channel multi-photon states ⋮ Some variational principles for \(Z\)-eigenvalues of nonnegative tensors ⋮ A note on the fourth cumulant of a finite mixture distribution ⋮ Convergence of an algorithm for the largest singular value of a nonnegative rectangular tensor ⋮ An efficient iterative method for solving a class of constrained tensor least squares problem ⋮ Bounds for the spectral radius of nonnegative tensors ⋮ On some spectral radius inequalities for the Hadamard product of nonnegative tensors ⋮ Some bounds of eigenvalues for Hadamard product and Fan product of tensors ⋮ Z-eigenvalue localization sets for tensors and the applications in rank-one approximation and quantum entanglement ⋮ H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph ⋮ Geometric simplicity of spectral radius of nonnegative irreducible tensors ⋮ Linear convergence of an algorithm for largest singular value of a nonnegative rectangular tensor ⋮ A general product of tensors with applications ⋮ The solution methods for the largest eigenvalue (singular value) of nonnegative tensors and convergence analysis ⋮ Bounds for the greatest eigenvalue of positive tensors ⋮ New bounds for eigenvalues of strictly diagonally dominant tensors ⋮ Spectra of symmetric tensors and \(m\)-root Finsler models ⋮ A tensor singular values and its symmetric embedding eigenvalues ⋮ Exponential type locally generalized strictly double diagonally tensors and eigenvalue localization ⋮ Algebraic boundaries among typical ranks for real binary forms of arbitrary degree ⋮ A new definition of geometric multiplicity of eigenvalues of tensors and some results based on it ⋮ A note on the three-way generalization of the Jordan canonical form ⋮ Computing the generalized eigenvalues of weakly symmetric tensors ⋮ Real eigenvalues of nonsymmetric tensors ⋮ A new bound for the spectral radius of nonnegative tensors ⋮ Existence of real eigenvalues of real tensors ⋮ Improved Approximation of the Sum of Random Vectors by the Skew Normal Distribution ⋮ Singular values of nonnegative rectangular tensors ⋮ Subtracting a best rank‐1 approximation from p × p × 2(p≥2) tensors ⋮ A method with parameter for solving the spectral radius of nonnegative tensor ⋮ A modified Newton's method for best rank-one approximation to tensors ⋮ A survey of multilinear subspace learning for tensor data ⋮ Standard tensor and its applications in problem of singular values of tensors ⋮ Dynamic background modeling using tensor representation and ant colony optimization ⋮ The point-wise convergence of shifted symmetric higher order power method ⋮ Computing Tensor Eigenvalues via Homotopy Methods ⋮ Successive unconstrained dual optimization method for~rank-one approximation to tensors ⋮ Q-less QR decomposition in inner product spaces ⋮ On the cone eigenvalue complementarity problem for higher-order tensors ⋮ On eigenvalue problems of real symmetric tensors ⋮ Symmetric rank-1 approximation of symmetric high-order tensors ⋮ Concise formulae for the cumulant matrices of a random vector ⋮ Shifted power method for computing tensor H-eigenpairs ⋮ Partially symmetric nonnegative rectangular tensors and copositive rectangular tensors ⋮ New eigenvalue inclusion sets for tensors ⋮ Jordan canonical form of three-way tensor with multilinear rank \((4,4,3)\) ⋮ A Unifying Perron--Frobenius Theorem for Nonnegative Tensors via Multihomogeneous Maps ⋮ Some results on Brauer-type and Brualdi-type eigenvalue inclusion sets for tensors ⋮ Conditions for strong ellipticity and M-eigenvalues ⋮ Bounds for spectral radius of nonnegative tensors using matrix-digragh-based approach ⋮ A locally convergent Jacobi iteration for the tensor singular value problem ⋮ A new eigenvalue inclusion set for tensors and its applications ⋮ Backward error and perturbation bounds for high order Sylvester tensor equation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvalues and invariants of tensors
• The degree of the E-characteristic polynomial of an even order tensor
• Z-eigenvalue methods for a global polynomial optimization problem
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
• Independent component analysis, a new concept?
• Decomposition of quantics in sums of powers of linear forms
• Nondifferentiable optimization and polynomial problems
• On blind source separation using mutual information criterion
• Semidefinite programming relaxations for semialgebraic problems
• Random sampling and approximation of MAX-CSPs
• Hilbert's 17th problem and best dual bounds in quadratic minimization
• 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 to higher-order symmetric tensors
• Optimization theory and methods. Nonlinear programming
• Ranks of tensors and change of base field
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Global Optimization with Polynomials and the Problem of Moments
• Orthogonal Tensor Decompositions
• Rank-One Approximation to High Order Tensors
• On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
• A Decomposition for Three-Way Arrays
• On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors
• Tensor decomposition and approximation schemes for constraint satisfaction problems
• Tensor Methods for Nonlinear Equations
• Class of global minimum bounds of polynomial functions
• Tensor Methods for Unconstrained Optimization Using Second Derivatives
• A Multilinear Singular Value Decomposition
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition
• Polynomial Programming: LP-Relaxations Also Converge
• Optimization of Polynomials on Compact Semialgebraic Sets
• Symmetric Tensors and Symmetric Tensor Rank
• Robust iterative fitting of multilinear models
• A Sum of Squares Approximation of Nonnegative Polynomials
• Semidefinite Programming vs. LP Relaxations for Polynomial Programming